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.r285-smll-171654422100166.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Peterson-PT-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422100166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 48K Apr 12 02:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 222K Apr 12 02:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K Apr 12 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 75K Apr 12 03:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 304K Apr 12 03:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 212K Apr 12 03:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 982K Apr 12 03:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 298K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716899301868

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-28 12:28:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 12:28:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 12:28:24] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-28 12:28:24] [INFO ] Transformed 480 places.
[2024-05-28 12:28:24] [INFO ] Transformed 690 transitions.
[2024-05-28 12:28:24] [INFO ] Found NUPN structural information;
[2024-05-28 12:28:24] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
FORMULA Peterson-PT-4-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 630 out of 690 initially.
// Phase 1: matrix 630 rows 480 cols
[2024-05-28 12:28:24] [INFO ] Computed 19 invariants in 30 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 13) seen :28
FORMULA Peterson-PT-4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :21
FORMULA Peterson-PT-4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-28 12:28:25] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-28 12:28:25] [INFO ] Computed 19 invariants in 12 ms
[2024-05-28 12:28:25] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned unsat
[2024-05-28 12:28:25] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-05-28 12:28:25] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-28 12:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:28:26] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-05-28 12:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:28:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-05-28 12:28:26] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-28 12:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:28:26] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2024-05-28 12:28:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 12:28:26] [INFO ] [Nat]Added 116 Read/Feed constraints in 52 ms returned sat
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 7 ms to minimize.
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 1 ms to minimize.
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 1 ms to minimize.
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 61 places in 256 ms of which 2 ms to minimize.
[2024-05-28 12:28:28] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 1 ms to minimize.
[2024-05-28 12:28:28] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 1 ms to minimize.
[2024-05-28 12:28:28] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 1 ms to minimize.
[2024-05-28 12:28:28] [INFO ] Deduced a trap composed of 54 places in 184 ms of which 1 ms to minimize.
[2024-05-28 12:28:29] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 1 ms to minimize.
[2024-05-28 12:28:29] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2024-05-28 12:28:29] [INFO ] Deduced a trap composed of 87 places in 228 ms of which 1 ms to minimize.
[2024-05-28 12:28:29] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 1 ms to minimize.
[2024-05-28 12:28:30] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 1 ms to minimize.
[2024-05-28 12:28:30] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 1 ms to minimize.
[2024-05-28 12:28:30] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 1 ms to minimize.
[2024-05-28 12:28:30] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 0 ms to minimize.
[2024-05-28 12:28:31] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 1 ms to minimize.
[2024-05-28 12:28:31] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 4477 ms
[2024-05-28 12:28:31] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned unsat
[2024-05-28 12:28:31] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned unsat
[2024-05-28 12:28:31] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned unsat
[2024-05-28 12:28:31] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-28 12:28:31] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-28 12:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:28:32] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2024-05-28 12:28:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:28:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-05-28 12:28:32] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-28 12:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:28:32] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2024-05-28 12:28:32] [INFO ] [Nat]Added 116 Read/Feed constraints in 97 ms returned sat
[2024-05-28 12:28:32] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 0 ms to minimize.
[2024-05-28 12:28:33] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 1 ms to minimize.
[2024-05-28 12:28:33] [INFO ] Deduced a trap composed of 17 places in 303 ms of which 1 ms to minimize.
[2024-05-28 12:28:33] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 0 ms to minimize.
[2024-05-28 12:28:33] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 1 ms to minimize.
[2024-05-28 12:28:34] [INFO ] Deduced a trap composed of 151 places in 225 ms of which 0 ms to minimize.
[2024-05-28 12:28:34] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 1 ms to minimize.
[2024-05-28 12:28:34] [INFO ] Deduced a trap composed of 65 places in 165 ms of which 1 ms to minimize.
[2024-05-28 12:28:34] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 1 ms to minimize.
[2024-05-28 12:28:35] [INFO ] Deduced a trap composed of 62 places in 164 ms of which 0 ms to minimize.
[2024-05-28 12:28:35] [INFO ] Deduced a trap composed of 91 places in 162 ms of which 1 ms to minimize.
[2024-05-28 12:28:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2851 ms
[2024-05-28 12:28:35] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 60 ms.
[2024-05-28 12:28:37] [INFO ] Deduced a trap composed of 2 places in 297 ms of which 1 ms to minimize.
[2024-05-28 12:28:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 12:28:37] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-28 12:28:37] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-28 12:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:28:37] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2024-05-28 12:28:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:28:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-05-28 12:28:37] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-28 12:28:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:28:38] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2024-05-28 12:28:38] [INFO ] [Nat]Added 116 Read/Feed constraints in 19 ms returned sat
[2024-05-28 12:28:38] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 73 ms.
[2024-05-28 12:28:40] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 1 ms to minimize.
[2024-05-28 12:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2024-05-28 12:28:40] [INFO ] Added : 169 causal constraints over 34 iterations in 2341 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 5, 5, 100, 1] Max seen :[5, 1, 5, 5, 5, 2, 0]
FORMULA Peterson-PT-4-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 106 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 480 transition count 611
Reduce places removed 79 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 158 rules applied. Total rules applied 237 place count 401 transition count 532
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 316 place count 322 transition count 532
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 316 place count 322 transition count 497
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 386 place count 287 transition count 497
Applied a total of 386 rules in 138 ms. Remains 287 /480 variables (removed 193) and now considering 497/690 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 287/480 places, 497/690 transitions.
Normalized transition count is 437 out of 497 initially.
// Phase 1: matrix 437 rows 287 cols
[2024-05-28 12:28:41] [INFO ] Computed 19 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3359 ms. (steps per millisecond=297 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 878 ms. (steps per millisecond=1138 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2370 ms. (steps per millisecond=421 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 3) seen :5
[2024-05-28 12:28:48] [INFO ] Flow matrix only has 437 transitions (discarded 60 similar events)
// Phase 1: matrix 437 rows 287 cols
[2024-05-28 12:28:48] [INFO ] Computed 19 invariants in 3 ms
[2024-05-28 12:28:48] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-28 12:28:48] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-28 12:28:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:28:49] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-28 12:28:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:28:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-28 12:28:49] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-28 12:28:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:28:49] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-28 12:28:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 12:28:49] [INFO ] [Nat]Added 116 Read/Feed constraints in 27 ms returned sat
[2024-05-28 12:28:49] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 1 ms to minimize.
[2024-05-28 12:28:49] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 1 ms to minimize.
[2024-05-28 12:28:49] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
[2024-05-28 12:28:50] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2024-05-28 12:28:50] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2024-05-28 12:28:50] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 1 ms to minimize.
[2024-05-28 12:28:50] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 1 ms to minimize.
[2024-05-28 12:28:50] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 0 ms to minimize.
[2024-05-28 12:28:50] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2024-05-28 12:28:51] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 1 ms to minimize.
[2024-05-28 12:28:51] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2024-05-28 12:28:51] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2024-05-28 12:28:51] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 0 ms to minimize.
[2024-05-28 12:28:51] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 1 ms to minimize.
[2024-05-28 12:28:52] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 1 ms to minimize.
[2024-05-28 12:28:52] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 0 ms to minimize.
[2024-05-28 12:28:52] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2024-05-28 12:28:52] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2024-05-28 12:28:52] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 0 ms to minimize.
[2024-05-28 12:28:52] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 0 ms to minimize.
[2024-05-28 12:28:52] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 0 ms to minimize.
[2024-05-28 12:28:53] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 0 ms to minimize.
[2024-05-28 12:28:53] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2024-05-28 12:28:53] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 0 ms to minimize.
[2024-05-28 12:28:53] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 1 ms to minimize.
[2024-05-28 12:28:53] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2024-05-28 12:28:53] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 1 ms to minimize.
[2024-05-28 12:28:53] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2024-05-28 12:28:53] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 0 ms to minimize.
[2024-05-28 12:28:55] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-05-28 12:28:55] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2024-05-28 12:28:55] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2024-05-28 12:28:55] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 0 ms to minimize.
[2024-05-28 12:28:56] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 0 ms to minimize.
[2024-05-28 12:28:56] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 0 ms to minimize.
[2024-05-28 12:28:56] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-28 12:28:56] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-28 12:28:56] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2024-05-28 12:28:56] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 10 ms to minimize.
[2024-05-28 12:28:56] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2024-05-28 12:28:57] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 0 ms to minimize.
[2024-05-28 12:28:57] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 0 ms to minimize.
[2024-05-28 12:28:57] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-05-28 12:28:57] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2024-05-28 12:28:58] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 0 ms to minimize.
[2024-05-28 12:28:58] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 0 ms to minimize.
[2024-05-28 12:28:58] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-05-28 12:29:00] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2024-05-28 12:29:01] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 0 ms to minimize.
[2024-05-28 12:29:01] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:29:01] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-05-28 12:29:01] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2024-05-28 12:29:01] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 0 ms to minimize.
[2024-05-28 12:29:04] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2024-05-28 12:29:04] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:29:04] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2024-05-28 12:29:04] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:29:05] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:29:05] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:29:05] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:29:06] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 0 ms to minimize.
[2024-05-28 12:29:09] [INFO ] Trap strengthening (SAT) tested/added 61/61 trap constraints in 19675 ms
[2024-05-28 12:29:09] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-28 12:29:09] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-28 12:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:29:09] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-28 12:29:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:29:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-28 12:29:09] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-28 12:29:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:29:09] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-28 12:29:09] [INFO ] [Nat]Added 116 Read/Feed constraints in 54 ms returned sat
[2024-05-28 12:29:09] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 1 ms to minimize.
[2024-05-28 12:29:10] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 1 ms to minimize.
[2024-05-28 12:29:10] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 0 ms to minimize.
[2024-05-28 12:29:10] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 1 ms to minimize.
[2024-05-28 12:29:10] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 1 ms to minimize.
[2024-05-28 12:29:10] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 1 ms to minimize.
[2024-05-28 12:29:11] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 1 ms to minimize.
[2024-05-28 12:29:11] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 1 ms to minimize.
[2024-05-28 12:29:11] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 0 ms to minimize.
[2024-05-28 12:29:11] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 0 ms to minimize.
[2024-05-28 12:29:11] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 0 ms to minimize.
[2024-05-28 12:29:12] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 1 ms to minimize.
[2024-05-28 12:29:12] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 1 ms to minimize.
[2024-05-28 12:29:12] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 1 ms to minimize.
[2024-05-28 12:29:12] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 1 ms to minimize.
[2024-05-28 12:29:12] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 0 ms to minimize.
[2024-05-28 12:29:13] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 1 ms to minimize.
[2024-05-28 12:29:13] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 0 ms to minimize.
[2024-05-28 12:29:13] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 1 ms to minimize.
[2024-05-28 12:29:13] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3754 ms
[2024-05-28 12:29:13] [INFO ] Computed and/alt/rep : 396/913/396 causal constraints (skipped 36 transitions) in 51 ms.
[2024-05-28 12:29:14] [INFO ] Added : 194 causal constraints over 40 iterations in 1448 ms. Result :sat
Minimization took 150 ms.
[2024-05-28 12:29:15] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-28 12:29:15] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-28 12:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:29:15] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-28 12:29:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:29:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-28 12:29:15] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-28 12:29:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:29:15] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-28 12:29:15] [INFO ] [Nat]Added 116 Read/Feed constraints in 15 ms returned sat
[2024-05-28 12:29:15] [INFO ] Computed and/alt/rep : 396/913/396 causal constraints (skipped 36 transitions) in 36 ms.
[2024-05-28 12:29:15] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2024-05-28 12:29:16] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2024-05-28 12:29:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2024-05-28 12:29:16] [INFO ] Added : 51 causal constraints over 12 iterations in 670 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [5, 100, 1] Max seen :[1, 4, 0]
Support contains 106 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 497/497 transitions.
Applied a total of 0 rules in 28 ms. Remains 287 /287 variables (removed 0) and now considering 497/497 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 287/287 places, 497/497 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 497/497 transitions.
Applied a total of 0 rules in 27 ms. Remains 287 /287 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2024-05-28 12:29:16] [INFO ] Flow matrix only has 437 transitions (discarded 60 similar events)
[2024-05-28 12:29:16] [INFO ] Invariant cache hit.
[2024-05-28 12:29:16] [INFO ] Implicit Places using invariants in 231 ms returned [274, 275, 276, 277, 278]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 234 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 282/287 places, 497/497 transitions.
Applied a total of 0 rules in 28 ms. Remains 282 /282 variables (removed 0) and now considering 497/497 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 289 ms. Remains : 282/287 places, 497/497 transitions.
Normalized transition count is 437 out of 497 initially.
// Phase 1: matrix 437 rows 282 cols
[2024-05-28 12:29:16] [INFO ] Computed 14 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3223 ms. (steps per millisecond=310 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 878 ms. (steps per millisecond=1138 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2367 ms. (steps per millisecond=422 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 3) seen :5
[2024-05-28 12:29:24] [INFO ] Flow matrix only has 437 transitions (discarded 60 similar events)
// Phase 1: matrix 437 rows 282 cols
[2024-05-28 12:29:24] [INFO ] Computed 14 invariants in 3 ms
[2024-05-28 12:29:24] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-28 12:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:29:24] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-28 12:29:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:29:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-28 12:29:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:29:24] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-28 12:29:24] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 12:29:24] [INFO ] [Nat]Added 116 Read/Feed constraints in 24 ms returned sat
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 0 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 1 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 1 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 0 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 0 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 1 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 0 ms to minimize.
[2024-05-28 12:29:27] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-05-28 12:29:27] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 0 ms to minimize.
[2024-05-28 12:29:27] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 1 ms to minimize.
[2024-05-28 12:29:27] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2024-05-28 12:29:27] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2024-05-28 12:29:27] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 1 ms to minimize.
[2024-05-28 12:29:27] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 0 ms to minimize.
[2024-05-28 12:29:27] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 1 ms to minimize.
[2024-05-28 12:29:28] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 1 ms to minimize.
[2024-05-28 12:29:29] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 1 ms to minimize.
[2024-05-28 12:29:29] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 0 ms to minimize.
[2024-05-28 12:29:29] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 0 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 0 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 1 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 1 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 0 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 1 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 1 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 1 ms to minimize.
[2024-05-28 12:29:31] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 0 ms to minimize.
[2024-05-28 12:29:31] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 0 ms to minimize.
[2024-05-28 12:29:31] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 0 ms to minimize.
[2024-05-28 12:29:31] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 1 ms to minimize.
[2024-05-28 12:29:31] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 0 ms to minimize.
[2024-05-28 12:29:32] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 1 ms to minimize.
[2024-05-28 12:29:32] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 1 ms to minimize.
[2024-05-28 12:29:32] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 0 ms to minimize.
[2024-05-28 12:29:33] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 0 ms to minimize.
[2024-05-28 12:29:33] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 0 ms to minimize.
[2024-05-28 12:29:33] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 1 ms to minimize.
[2024-05-28 12:29:33] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2024-05-28 12:29:34] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:29:34] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 1 ms to minimize.
[2024-05-28 12:29:34] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 1 ms to minimize.
[2024-05-28 12:29:35] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2024-05-28 12:29:35] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:29:35] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 0 ms to minimize.
[2024-05-28 12:29:35] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 0 ms to minimize.
[2024-05-28 12:29:35] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:29:36] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:29:36] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 0 ms to minimize.
[2024-05-28 12:29:36] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 0 ms to minimize.
[2024-05-28 12:29:38] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 0 ms to minimize.
[2024-05-28 12:29:38] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 0 ms to minimize.
[2024-05-28 12:29:41] [INFO ] Trap strengthening (SAT) tested/added 62/62 trap constraints in 17272 ms
[2024-05-28 12:29:41] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned unsat
[2024-05-28 12:29:41] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-28 12:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:29:42] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-28 12:29:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:29:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-28 12:29:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:29:42] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-28 12:29:42] [INFO ] [Nat]Added 116 Read/Feed constraints in 14 ms returned sat
[2024-05-28 12:29:42] [INFO ] Computed and/alt/rep : 396/913/396 causal constraints (skipped 36 transitions) in 34 ms.
[2024-05-28 12:29:42] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2024-05-28 12:29:43] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2024-05-28 12:29:43] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 0 ms to minimize.
[2024-05-28 12:29:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 446 ms
[2024-05-28 12:29:43] [INFO ] Added : 56 causal constraints over 13 iterations in 844 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 1] Max seen :[1, 5, 0]
FORMULA Peterson-PT-4-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 497/497 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 282 transition count 461
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 246 transition count 461
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 72 place count 246 transition count 397
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 200 place count 182 transition count 397
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 240 place count 162 transition count 377
Applied a total of 240 rules in 40 ms. Remains 162 /282 variables (removed 120) and now considering 377/497 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 162/282 places, 377/497 transitions.
Normalized transition count is 317 out of 377 initially.
// Phase 1: matrix 317 rows 162 cols
[2024-05-28 12:29:43] [INFO ] Computed 14 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1381 ms. (steps per millisecond=724 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 576 ms. (steps per millisecond=1736 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=2127 ) properties (out of 2) seen :1
[2024-05-28 12:29:45] [INFO ] Flow matrix only has 317 transitions (discarded 60 similar events)
// Phase 1: matrix 317 rows 162 cols
[2024-05-28 12:29:45] [INFO ] Computed 14 invariants in 1 ms
[2024-05-28 12:29:45] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 12:29:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:29:46] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-28 12:29:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:29:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 12:29:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:29:46] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-28 12:29:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 12:29:46] [INFO ] [Nat]Added 116 Read/Feed constraints in 17 ms returned sat
[2024-05-28 12:29:46] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2024-05-28 12:29:46] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:29:46] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2024-05-28 12:29:46] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:29:46] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:29:46] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2024-05-28 12:29:46] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:29:46] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2024-05-28 12:29:46] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:29:47] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-28 12:29:47] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:29:47] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2024-05-28 12:29:47] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2024-05-28 12:29:47] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2024-05-28 12:29:47] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2024-05-28 12:29:47] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2024-05-28 12:29:47] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2024-05-28 12:29:47] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2024-05-28 12:29:47] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2024-05-28 12:29:47] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:29:48] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2024-05-28 12:29:48] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:29:48] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2024-05-28 12:29:48] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2024-05-28 12:29:48] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-05-28 12:29:48] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2024-05-28 12:29:48] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-28 12:29:49] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2024-05-28 12:29:49] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 0 ms to minimize.
[2024-05-28 12:29:49] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:29:49] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:29:49] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2024-05-28 12:29:49] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2024-05-28 12:29:49] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2024-05-28 12:29:49] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2024-05-28 12:29:49] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2024-05-28 12:29:50] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2024-05-28 12:29:50] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2024-05-28 12:29:50] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2024-05-28 12:29:51] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2024-05-28 12:29:51] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2024-05-28 12:29:51] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2024-05-28 12:29:51] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2024-05-28 12:29:51] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:29:51] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:29:51] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-28 12:29:52] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2024-05-28 12:29:52] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:29:52] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-28 12:29:52] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:29:52] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:29:52] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:29:52] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:29:52] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:29:52] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:29:52] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:29:53] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2024-05-28 12:29:53] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:29:53] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2024-05-28 12:29:53] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:29:53] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:29:54] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:29:54] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-05-28 12:29:54] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:29:55] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:29:55] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-05-28 12:29:56] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2024-05-28 12:29:56] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:29:56] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:29:57] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:29:59] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2024-05-28 12:30:02] [INFO ] Trap strengthening (SAT) tested/added 71/71 trap constraints in 16243 ms
[2024-05-28 12:30:02] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 12:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:30:02] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-05-28 12:30:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:30:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-28 12:30:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:30:02] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-28 12:30:02] [INFO ] [Nat]Added 116 Read/Feed constraints in 15 ms returned sat
[2024-05-28 12:30:02] [INFO ] Computed and/alt/rep : 276/793/276 causal constraints (skipped 36 transitions) in 33 ms.
[2024-05-28 12:30:03] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-28 12:30:03] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:30:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2024-05-28 12:30:03] [INFO ] Added : 44 causal constraints over 10 iterations in 496 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [5, 1] Max seen :[1, 0]
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 377/377 transitions.
Applied a total of 0 rules in 23 ms. Remains 162 /162 variables (removed 0) and now considering 377/377 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 162/162 places, 377/377 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 377/377 transitions.
Applied a total of 0 rules in 15 ms. Remains 162 /162 variables (removed 0) and now considering 377/377 (removed 0) transitions.
[2024-05-28 12:30:03] [INFO ] Flow matrix only has 317 transitions (discarded 60 similar events)
[2024-05-28 12:30:03] [INFO ] Invariant cache hit.
[2024-05-28 12:30:03] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-28 12:30:03] [INFO ] Flow matrix only has 317 transitions (discarded 60 similar events)
[2024-05-28 12:30:03] [INFO ] Invariant cache hit.
[2024-05-28 12:30:03] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 12:30:04] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2024-05-28 12:30:04] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-28 12:30:04] [INFO ] Flow matrix only has 317 transitions (discarded 60 similar events)
[2024-05-28 12:30:04] [INFO ] Invariant cache hit.
[2024-05-28 12:30:04] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1116 ms. Remains : 162/162 places, 377/377 transitions.
Starting property specific reduction for Peterson-PT-4-UpperBounds-02
Normalized transition count is 317 out of 377 initially.
// Phase 1: matrix 317 rows 162 cols
[2024-05-28 12:30:04] [INFO ] Computed 14 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :1
[2024-05-28 12:30:04] [INFO ] Flow matrix only has 317 transitions (discarded 60 similar events)
// Phase 1: matrix 317 rows 162 cols
[2024-05-28 12:30:04] [INFO ] Computed 14 invariants in 1 ms
[2024-05-28 12:30:04] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-28 12:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:30:04] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-28 12:30:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:30:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-28 12:30:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:30:05] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2024-05-28 12:30:05] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 12:30:05] [INFO ] [Nat]Added 116 Read/Feed constraints in 20 ms returned sat
[2024-05-28 12:30:05] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2024-05-28 12:30:05] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2024-05-28 12:30:05] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-05-28 12:30:05] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-28 12:30:05] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2024-05-28 12:30:05] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2024-05-28 12:30:05] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-28 12:30:05] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-28 12:30:06] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-28 12:30:06] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2024-05-28 12:30:06] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2024-05-28 12:30:06] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2024-05-28 12:30:06] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2024-05-28 12:30:06] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-28 12:30:06] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2024-05-28 12:30:06] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-05-28 12:30:06] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2024-05-28 12:30:06] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2024-05-28 12:30:07] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-05-28 12:30:07] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-28 12:30:07] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-28 12:30:07] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2024-05-28 12:30:07] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-05-28 12:30:07] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-28 12:30:08] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 12:30:08] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-28 12:30:08] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-28 12:30:08] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2024-05-28 12:30:08] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2024-05-28 12:30:08] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:30:08] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:30:08] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:30:08] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 0 ms to minimize.
[2024-05-28 12:30:09] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-28 12:30:09] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-28 12:30:09] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2024-05-28 12:30:09] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:30:09] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2024-05-28 12:30:09] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 4784 ms
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 377/377 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 161 transition count 376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 161 transition count 375
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 160 transition count 375
Applied a total of 4 rules in 14 ms. Remains 160 /162 variables (removed 2) and now considering 375/377 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 160/162 places, 375/377 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2024-05-28 12:30:09] [INFO ] Computed 14 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1377 ms. (steps per millisecond=726 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 533 ms. (steps per millisecond=1876 ) properties (out of 1) seen :1
[2024-05-28 12:30:11] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2024-05-28 12:30:11] [INFO ] Computed 14 invariants in 1 ms
[2024-05-28 12:30:11] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-28 12:30:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:30:11] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-28 12:30:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:30:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 12:30:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:30:12] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-28 12:30:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 12:30:12] [INFO ] [Nat]Added 116 Read/Feed constraints in 17 ms returned sat
[2024-05-28 12:30:12] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2024-05-28 12:30:12] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2024-05-28 12:30:12] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 0 ms to minimize.
[2024-05-28 12:30:12] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2024-05-28 12:30:12] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2024-05-28 12:30:12] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 0 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2024-05-28 12:30:14] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 0 ms to minimize.
[2024-05-28 12:30:14] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 0 ms to minimize.
[2024-05-28 12:30:14] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2024-05-28 12:30:14] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2024-05-28 12:30:14] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-28 12:30:14] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-28 12:30:14] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2024-05-28 12:30:14] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:30:15] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2024-05-28 12:30:15] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2024-05-28 12:30:15] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2024-05-28 12:30:15] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2024-05-28 12:30:15] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2024-05-28 12:30:15] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2024-05-28 12:30:15] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2024-05-28 12:30:16] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:30:16] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:30:16] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2024-05-28 12:30:16] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2024-05-28 12:30:16] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-28 12:30:16] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:30:16] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-28 12:30:18] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2024-05-28 12:30:18] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:30:18] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:30:18] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2024-05-28 12:30:19] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2024-05-28 12:30:19] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2024-05-28 12:30:19] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2024-05-28 12:30:19] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-28 12:30:19] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:30:19] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:30:19] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2024-05-28 12:30:19] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 0 ms to minimize.
[2024-05-28 12:30:19] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 0 ms to minimize.
[2024-05-28 12:30:19] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:30:21] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2024-05-28 12:30:21] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2024-05-28 12:30:21] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-28 12:30:21] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2024-05-28 12:30:21] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2024-05-28 12:30:21] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2024-05-28 12:30:22] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:30:22] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2024-05-28 12:30:22] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-28 12:30:23] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:30:23] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 0 ms to minimize.
[2024-05-28 12:30:23] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2024-05-28 12:30:24] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2024-05-28 12:30:24] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:30:25] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-28 12:30:25] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-28 12:30:25] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-28 12:30:27] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2024-05-28 12:30:29] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:30:32] [INFO ] Trap strengthening (SAT) tested/added 70/70 trap constraints in 20671 ms
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 11 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 160/160 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-28 12:30:32] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-28 12:30:32] [INFO ] Invariant cache hit.
[2024-05-28 12:30:33] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-28 12:30:33] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-28 12:30:33] [INFO ] Invariant cache hit.
[2024-05-28 12:30:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 12:30:33] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2024-05-28 12:30:33] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-28 12:30:33] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-28 12:30:33] [INFO ] Invariant cache hit.
[2024-05-28 12:30:33] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 905 ms. Remains : 160/160 places, 375/375 transitions.
Ending property specific reduction for Peterson-PT-4-UpperBounds-02 in 29195 ms.
Starting property specific reduction for Peterson-PT-4-UpperBounds-14
Normalized transition count is 317 out of 377 initially.
// Phase 1: matrix 317 rows 162 cols
[2024-05-28 12:30:33] [INFO ] Computed 14 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-28 12:30:33] [INFO ] Flow matrix only has 317 transitions (discarded 60 similar events)
// Phase 1: matrix 317 rows 162 cols
[2024-05-28 12:30:33] [INFO ] Computed 14 invariants in 1 ms
[2024-05-28 12:30:33] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 12:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:30:33] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-28 12:30:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:30:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 12:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:30:34] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-28 12:30:34] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 12:30:34] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2024-05-28 12:30:34] [INFO ] Computed and/alt/rep : 276/793/276 causal constraints (skipped 36 transitions) in 26 ms.
[2024-05-28 12:30:34] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2024-05-28 12:30:34] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-28 12:30:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 189 ms
[2024-05-28 12:30:34] [INFO ] Added : 44 causal constraints over 10 iterations in 443 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 162 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 376/376 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 374
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 1 place count 161 transition count 369
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 11 place count 156 transition count 369
Applied a total of 11 rules in 17 ms. Remains 156 /162 variables (removed 6) and now considering 369/376 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 156/162 places, 369/376 transitions.
Normalized transition count is 309 out of 369 initially.
// Phase 1: matrix 309 rows 156 cols
[2024-05-28 12:30:34] [INFO ] Computed 14 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1279 ms. (steps per millisecond=781 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=2267 ) properties (out of 1) seen :0
[2024-05-28 12:30:36] [INFO ] Flow matrix only has 309 transitions (discarded 60 similar events)
// Phase 1: matrix 309 rows 156 cols
[2024-05-28 12:30:36] [INFO ] Computed 14 invariants in 1 ms
[2024-05-28 12:30:36] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 12:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:30:36] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-28 12:30:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:30:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-28 12:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:30:36] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-28 12:30:36] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-28 12:30:36] [INFO ] [Nat]Added 115 Read/Feed constraints in 17 ms returned sat
[2024-05-28 12:30:36] [INFO ] Computed and/alt/rep : 268/779/268 causal constraints (skipped 36 transitions) in 31 ms.
[2024-05-28 12:30:37] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2024-05-28 12:30:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-28 12:30:37] [INFO ] Added : 46 causal constraints over 10 iterations in 479 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 369/369 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 369/369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 156/156 places, 369/369 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 369/369 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 369/369 (removed 0) transitions.
[2024-05-28 12:30:37] [INFO ] Flow matrix only has 309 transitions (discarded 60 similar events)
[2024-05-28 12:30:37] [INFO ] Invariant cache hit.
[2024-05-28 12:30:37] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-28 12:30:37] [INFO ] Flow matrix only has 309 transitions (discarded 60 similar events)
[2024-05-28 12:30:37] [INFO ] Invariant cache hit.
[2024-05-28 12:30:37] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-28 12:30:38] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2024-05-28 12:30:38] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 12:30:38] [INFO ] Flow matrix only has 309 transitions (discarded 60 similar events)
[2024-05-28 12:30:38] [INFO ] Invariant cache hit.
[2024-05-28 12:30:38] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1075 ms. Remains : 156/156 places, 369/369 transitions.
Ending property specific reduction for Peterson-PT-4-UpperBounds-14 in 4704 ms.
[2024-05-28 12:30:38] [INFO ] Flatten gal took : 94 ms
[2024-05-28 12:30:38] [INFO ] Applying decomposition
[2024-05-28 12:30:38] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15957525166753833566.txt' '-o' '/tmp/graph15957525166753833566.bin' '-w' '/tmp/graph15957525166753833566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15957525166753833566.bin' '-l' '-1' '-v' '-w' '/tmp/graph15957525166753833566.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:30:39] [INFO ] Decomposing Gal with order
[2024-05-28 12:30:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:30:39] [INFO ] Removed a total of 412 redundant transitions.
[2024-05-28 12:30:39] [INFO ] Flatten gal took : 108 ms
[2024-05-28 12:30:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 290 labels/synchronizations in 25 ms.
[2024-05-28 12:30:39] [INFO ] Time to serialize gal into /tmp/UpperBounds4114300744339363364.gal : 15 ms
[2024-05-28 12:30:39] [INFO ] Time to serialize properties into /tmp/UpperBounds6848948402513909477.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4114300744339363364.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6848948402513909477.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds6848948402513909477.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,4.31541e+06,68.0519,1221540,2,91779,5,3.67507e+06,6,0,1158,4.26076e+06,0
Total reachable state count : 4315408

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-4-UpperBounds-02 :0 <= gi0.gu2.CS_0+gi4.gi0.gu1.CS_1+gi4.gi0.gu23.CS_3+gi4.gi1.gu22.CS_2+gi4.gi0.gu8.CS_4 <= 1
FORMULA Peterson-PT-4-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-UpperBounds-02,0,68.0773,1221540,1,0,7,3.67507e+06,9,1,1463,4.26076e+06,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-4-UpperBounds-14 :0 <= gi6.gu24.TestIdentity_1_1_4 <= 1
FORMULA Peterson-PT-4-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-UpperBounds-14,0,68.0828,1221540,1,0,8,3.67507e+06,10,1,1538,4.26076e+06,5
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 203336 ms.

BK_STOP 1716899508607

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;