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-171654422000136.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-COL-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422000136
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 9.1K Apr 12 02:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 02:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 02:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 03:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 44K 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-COL-4-UpperBounds-00
FORMULA_NAME Peterson-COL-4-UpperBounds-01
FORMULA_NAME Peterson-COL-4-UpperBounds-02
FORMULA_NAME Peterson-COL-4-UpperBounds-03
FORMULA_NAME Peterson-COL-4-UpperBounds-04
FORMULA_NAME Peterson-COL-4-UpperBounds-05
FORMULA_NAME Peterson-COL-4-UpperBounds-06
FORMULA_NAME Peterson-COL-4-UpperBounds-07
FORMULA_NAME Peterson-COL-4-UpperBounds-08
FORMULA_NAME Peterson-COL-4-UpperBounds-09
FORMULA_NAME Peterson-COL-4-UpperBounds-10
FORMULA_NAME Peterson-COL-4-UpperBounds-11
FORMULA_NAME Peterson-COL-4-UpperBounds-12
FORMULA_NAME Peterson-COL-4-UpperBounds-13
FORMULA_NAME Peterson-COL-4-UpperBounds-14
FORMULA_NAME Peterson-COL-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716880025118

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-COL-4
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-28 07:07:07] [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 07:07:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:07:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 07:07:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 07:07:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 757 ms
[2024-05-28 07:07:08] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 147 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2024-05-28 07:07:08] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 16 ms.
[2024-05-28 07:07:08] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2024-05-28 07:07:08] [INFO ] Computed 1 invariants in 3 ms
FORMULA Peterson-COL-4-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 07:07:08] [INFO ] Invariant cache hit.
[2024-05-28 07:07:09] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-28 07:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:09] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-28 07:07:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 07:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:09] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-28 07:07:09] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-28 07:07:09] [INFO ] Added : 11 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 12 ms.
[2024-05-28 07:07:09] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 07:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:09] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-28 07:07:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 07:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-28 07:07:09] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:07:09] [INFO ] Added : 12 causal constraints over 4 iterations in 30 ms. Result :sat
Minimization took 8 ms.
[2024-05-28 07:07:09] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 07:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:09] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-28 07:07:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 07:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:09] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 07:07:09] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 07:07:09] [INFO ] Added : 11 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 6 ms.
[2024-05-28 07:07:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 07:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:09] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-28 07:07:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 07:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-28 07:07:09] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 07:07:09] [INFO ] Added : 11 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 6 ms.
[2024-05-28 07:07:09] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 07:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:09] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 07:07:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 07:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:09] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-28 07:07:09] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:07:09] [INFO ] Added : 11 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 5 ms.
[2024-05-28 07:07:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-28 07:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-28 07:07:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 07:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:09] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-28 07:07:09] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:07:09] [INFO ] Added : 11 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 5 ms.
[2024-05-28 07:07:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 07:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:10] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-28 07:07:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 07:07:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:10] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-28 07:07:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:07:10] [INFO ] Added : 11 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 8 ms.
[2024-05-28 07:07:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 07:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:10] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 07:07:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 07:07:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:10] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-28 07:07:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 07:07:10] [INFO ] Added : 11 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 6 ms.
[2024-05-28 07:07:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 07:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-28 07:07:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:07:10] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-28 07:07:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 07:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-28 07:07:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 07:07:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:10] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 07:07:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:07:10] [INFO ] Added : 12 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 6 ms.
[2024-05-28 07:07:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 07:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:10] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-28 07:07:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 07:07:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-28 07:07:10] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 07:07:10] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5]
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 07:07:10] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 40 ms.
[2024-05-28 07:07:10] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 9 ms
Reduce places removed 20 places and 40 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 11) seen :43
FORMULA Peterson-COL-4-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :5
FORMULA Peterson-COL-4-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-28 07:07:10] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-28 07:07:10] [INFO ] Computed 19 invariants in 18 ms
[2024-05-28 07:07:10] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-28 07:07:10] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-28 07:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:11] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2024-05-28 07:07:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-28 07:07:11] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 12 ms returned sat
[2024-05-28 07:07:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:11] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2024-05-28 07:07:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 07:07:11] [INFO ] [Nat]Added 116 Read/Feed constraints in 44 ms returned sat
[2024-05-28 07:07:11] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 17 ms to minimize.
[2024-05-28 07:07:12] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 2 ms to minimize.
[2024-05-28 07:07:12] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 1 ms to minimize.
[2024-05-28 07:07:12] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 2 ms to minimize.
[2024-05-28 07:07:13] [INFO ] Deduced a trap composed of 103 places in 231 ms of which 2 ms to minimize.
[2024-05-28 07:07:13] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 1 ms to minimize.
[2024-05-28 07:07:13] [INFO ] Deduced a trap composed of 72 places in 240 ms of which 1 ms to minimize.
[2024-05-28 07:07:13] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 1 ms to minimize.
[2024-05-28 07:07:14] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 1 ms to minimize.
[2024-05-28 07:07:14] [INFO ] Deduced a trap composed of 73 places in 232 ms of which 0 ms to minimize.
[2024-05-28 07:07:14] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 1 ms to minimize.
[2024-05-28 07:07:14] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 1 ms to minimize.
[2024-05-28 07:07:15] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 1 ms to minimize.
[2024-05-28 07:07:15] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 1 ms to minimize.
[2024-05-28 07:07:15] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 0 ms to minimize.
[2024-05-28 07:07:15] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 1 ms to minimize.
[2024-05-28 07:07:16] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 0 ms to minimize.
[2024-05-28 07:07:16] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 0 ms to minimize.
[2024-05-28 07:07:16] [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 0
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.verifyPossible(DeadlockTester.java:919)
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 07:07:16] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-28 07:07:16] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2024-05-28 07:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:16] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2024-05-28 07:07:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-28 07:07:16] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2024-05-28 07:07:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:17] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2024-05-28 07:07:17] [INFO ] [Nat]Added 116 Read/Feed constraints in 33 ms returned sat
[2024-05-28 07:07:17] [INFO ] Deduced a trap composed of 61 places in 187 ms of which 0 ms to minimize.
[2024-05-28 07:07:17] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 0 ms to minimize.
[2024-05-28 07:07:17] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 0 ms to minimize.
[2024-05-28 07:07:17] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 1 ms to minimize.
[2024-05-28 07:07:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 955 ms
[2024-05-28 07:07:18] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 50 ms.
[2024-05-28 07:07:19] [INFO ] Deduced a trap composed of 30 places in 257 ms of which 1 ms to minimize.
[2024-05-28 07:07:20] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2024-05-28 07:07:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 589 ms
[2024-05-28 07:07:20] [INFO ] Added : 168 causal constraints over 34 iterations in 2311 ms. Result :sat
Minimization took 313 ms.
[2024-05-28 07:07:20] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-28 07:07:20] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-28 07:07:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:21] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2024-05-28 07:07:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-28 07:07:21] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2024-05-28 07:07:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:21] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2024-05-28 07:07:21] [INFO ] [Nat]Added 116 Read/Feed constraints in 42 ms returned sat
[2024-05-28 07:07:21] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 1 ms to minimize.
[2024-05-28 07:07:21] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 0 ms to minimize.
[2024-05-28 07:07:22] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 1 ms to minimize.
[2024-05-28 07:07:22] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 1 ms to minimize.
[2024-05-28 07:07:22] [INFO ] Deduced a trap composed of 103 places in 211 ms of which 1 ms to minimize.
[2024-05-28 07:07:22] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 1 ms to minimize.
[2024-05-28 07:07:23] [INFO ] Deduced a trap composed of 72 places in 311 ms of which 1 ms to minimize.
[2024-05-28 07:07:23] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 1 ms to minimize.
[2024-05-28 07:07:23] [INFO ] Deduced a trap composed of 76 places in 204 ms of which 1 ms to minimize.
[2024-05-28 07:07:24] [INFO ] Deduced a trap composed of 73 places in 211 ms of which 1 ms to minimize.
[2024-05-28 07:07:24] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 4 ms to minimize.
[2024-05-28 07:07:24] [INFO ] Deduced a trap composed of 54 places in 226 ms of which 1 ms to minimize.
[2024-05-28 07:07:24] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 1 ms to minimize.
[2024-05-28 07:07:25] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 1 ms to minimize.
[2024-05-28 07:07:25] [INFO ] Deduced a trap composed of 48 places in 186 ms of which 0 ms to minimize.
[2024-05-28 07:07:25] [INFO ] Deduced a trap composed of 80 places in 153 ms of which 0 ms to minimize.
[2024-05-28 07:07:25] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 1 ms to minimize.
[2024-05-28 07:07:26] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 1 ms to minimize.
[2024-05-28 07:07:26] [INFO ] Deduced a trap composed of 2 places in 356 ms of which 1 ms to minimize.
[2024-05-28 07:07:26] [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 2
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.verifyPossible(DeadlockTester.java:919)
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)
Current structural bounds on expressions (after SMT) : [5, 5, 5] Max seen :[1, 2, 1]
Support contains 105 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 480 transition count 610
Reduce places removed 80 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 160 rules applied. Total rules applied 240 place count 400 transition count 530
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 320 place count 320 transition count 530
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 320 place count 320 transition count 495
Deduced a syphon composed of 35 places in 7 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 390 place count 285 transition count 495
Applied a total of 390 rules in 105 ms. Remains 285 /480 variables (removed 195) and now considering 495/690 (removed 195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 285/480 places, 495/690 transitions.
Normalized transition count is 435 out of 495 initially.
// Phase 1: matrix 435 rows 285 cols
[2024-05-28 07:07:26] [INFO ] Computed 19 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2960 ms. (steps per millisecond=337 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 801 ms. (steps per millisecond=1248 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1795 ms. (steps per millisecond=557 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 783 ms. (steps per millisecond=1277 ) properties (out of 3) seen :3
[2024-05-28 07:07:33] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 285 cols
[2024-05-28 07:07:33] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 07:07:33] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-28 07:07:33] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-28 07:07:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:33] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-28 07:07:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-28 07:07:33] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-28 07:07:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:33] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-28 07:07:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 07:07:33] [INFO ] [Nat]Added 116 Read/Feed constraints in 35 ms returned sat
[2024-05-28 07:07:33] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-05-28 07:07:34] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2024-05-28 07:07:34] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2024-05-28 07:07:34] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2024-05-28 07:07:34] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2024-05-28 07:07:34] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 0 ms to minimize.
[2024-05-28 07:07:34] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 0 ms to minimize.
[2024-05-28 07:07:34] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-05-28 07:07:34] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2024-05-28 07:07:35] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 0 ms to minimize.
[2024-05-28 07:07:35] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2024-05-28 07:07:35] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2024-05-28 07:07:35] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2024-05-28 07:07:35] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 6 ms to minimize.
[2024-05-28 07:07:35] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2024-05-28 07:07:35] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2024-05-28 07:07:36] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2024-05-28 07:07:36] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 0 ms to minimize.
[2024-05-28 07:07:36] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2024-05-28 07:07:36] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-28 07:07:36] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2024-05-28 07:07:36] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2024-05-28 07:07:37] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 1 ms to minimize.
[2024-05-28 07:07:37] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-28 07:07:37] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2024-05-28 07:07:37] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 0 ms to minimize.
[2024-05-28 07:07:37] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2024-05-28 07:07:37] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 0 ms to minimize.
[2024-05-28 07:07:37] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2024-05-28 07:07:38] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-05-28 07:07:38] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 1 ms to minimize.
[2024-05-28 07:07:38] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2024-05-28 07:07:39] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2024-05-28 07:07:39] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 0 ms to minimize.
[2024-05-28 07:07:39] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2024-05-28 07:07:39] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 0 ms to minimize.
[2024-05-28 07:07:39] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 0 ms to minimize.
[2024-05-28 07:07:39] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 1 ms to minimize.
[2024-05-28 07:07:40] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2024-05-28 07:07:40] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 0 ms to minimize.
[2024-05-28 07:07:40] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 0 ms to minimize.
[2024-05-28 07:07:40] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 0 ms to minimize.
[2024-05-28 07:07:41] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2024-05-28 07:07:41] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2024-05-28 07:07:41] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-05-28 07:07:42] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 0 ms to minimize.
[2024-05-28 07:07:43] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 0 ms to minimize.
[2024-05-28 07:07:44] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 0 ms to minimize.
[2024-05-28 07:07:44] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-05-28 07:07:45] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 1 ms to minimize.
[2024-05-28 07:07:45] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 1 ms to minimize.
[2024-05-28 07:07:45] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 1 ms to minimize.
[2024-05-28 07:07:45] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2024-05-28 07:07:45] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2024-05-28 07:07:45] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 1 ms to minimize.
[2024-05-28 07:07:45] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 0 ms to minimize.
[2024-05-28 07:07:45] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 0 ms to minimize.
[2024-05-28 07:07:46] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 0 ms to minimize.
[2024-05-28 07:07:46] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2024-05-28 07:07:46] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 0 ms to minimize.
[2024-05-28 07:07:46] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 0 ms to minimize.
[2024-05-28 07:07:46] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 0 ms to minimize.
[2024-05-28 07:07:47] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 0 ms to minimize.
[2024-05-28 07:07:47] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2024-05-28 07:07:48] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 0 ms to minimize.
[2024-05-28 07:07:49] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 0 ms to minimize.
[2024-05-28 07:07:49] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 0 ms to minimize.
[2024-05-28 07:07:49] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2024-05-28 07:07:50] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 0 ms to minimize.
[2024-05-28 07:07:50] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2024-05-28 07:07:50] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 0 ms to minimize.
[2024-05-28 07:07:50] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2024-05-28 07:07:50] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2024-05-28 07:07:51] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 0 ms to minimize.
[2024-05-28 07:07:51] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2024-05-28 07:07:54] [INFO ] Trap strengthening (SAT) tested/added 75/75 trap constraints in 20471 ms
[2024-05-28 07:07:54] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-28 07:07:54] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-28 07:07:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:54] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-28 07:07:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-28 07:07:54] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2024-05-28 07:07:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:54] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-28 07:07:54] [INFO ] [Nat]Added 116 Read/Feed constraints in 25 ms returned sat
[2024-05-28 07:07:54] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2024-05-28 07:07:55] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 0 ms to minimize.
[2024-05-28 07:07:55] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2024-05-28 07:07:55] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
[2024-05-28 07:07:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 620 ms
[2024-05-28 07:07:55] [INFO ] Computed and/alt/rep : 394/911/394 causal constraints (skipped 36 transitions) in 36 ms.
[2024-05-28 07:07:56] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2024-05-28 07:07:56] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2024-05-28 07:07:56] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 0 ms to minimize.
[2024-05-28 07:07:56] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 0 ms to minimize.
[2024-05-28 07:07:56] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-28 07:07:56] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2024-05-28 07:07:57] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2024-05-28 07:07:57] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2024-05-28 07:07:57] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 1 ms to minimize.
[2024-05-28 07:07:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1498 ms
[2024-05-28 07:07:57] [INFO ] Added : 119 causal constraints over 25 iterations in 2374 ms. Result :sat
Minimization took 104 ms.
[2024-05-28 07:07:57] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-28 07:07:57] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-28 07:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:58] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-28 07:07:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:07:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-28 07:07:58] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-28 07:07:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:07:58] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-28 07:07:58] [INFO ] [Nat]Added 116 Read/Feed constraints in 26 ms returned sat
[2024-05-28 07:07:58] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2024-05-28 07:07:58] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2024-05-28 07:07:58] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2024-05-28 07:07:58] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2024-05-28 07:07:59] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2024-05-28 07:07:59] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 0 ms to minimize.
[2024-05-28 07:07:59] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2024-05-28 07:07:59] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 1 ms to minimize.
[2024-05-28 07:07:59] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2024-05-28 07:07:59] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 0 ms to minimize.
[2024-05-28 07:07:59] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-05-28 07:07:59] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
[2024-05-28 07:08:00] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2024-05-28 07:08:00] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2024-05-28 07:08:00] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2024-05-28 07:08:00] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2024-05-28 07:08:00] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 0 ms to minimize.
[2024-05-28 07:08:00] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 0 ms to minimize.
[2024-05-28 07:08:00] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 0 ms to minimize.
[2024-05-28 07:08:00] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 0 ms to minimize.
[2024-05-28 07:08:01] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2024-05-28 07:08:01] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2024-05-28 07:08:01] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 0 ms to minimize.
[2024-05-28 07:08:01] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2024-05-28 07:08:01] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 0 ms to minimize.
[2024-05-28 07:08:02] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 0 ms to minimize.
[2024-05-28 07:08:02] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2024-05-28 07:08:02] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 0 ms to minimize.
[2024-05-28 07:08:02] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 0 ms to minimize.
[2024-05-28 07:08:02] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2024-05-28 07:08:03] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 1 ms to minimize.
[2024-05-28 07:08:03] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2024-05-28 07:08:03] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 0 ms to minimize.
[2024-05-28 07:08:03] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2024-05-28 07:08:04] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-05-28 07:08:04] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 0 ms to minimize.
[2024-05-28 07:08:04] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2024-05-28 07:08:04] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 0 ms to minimize.
[2024-05-28 07:08:04] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2024-05-28 07:08:04] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 0 ms to minimize.
[2024-05-28 07:08:04] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
[2024-05-28 07:08:05] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-05-28 07:08:06] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 0 ms to minimize.
[2024-05-28 07:08:06] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 0 ms to minimize.
[2024-05-28 07:08:06] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 0 ms to minimize.
[2024-05-28 07:08:07] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 0 ms to minimize.
[2024-05-28 07:08:07] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-05-28 07:08:09] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 0 ms to minimize.
[2024-05-28 07:08:09] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-28 07:08:09] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2024-05-28 07:08:09] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 1 ms to minimize.
[2024-05-28 07:08:09] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2024-05-28 07:08:09] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 0 ms to minimize.
[2024-05-28 07:08:10] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 0 ms to minimize.
[2024-05-28 07:08:10] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 1 ms to minimize.
[2024-05-28 07:08:10] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 0 ms to minimize.
[2024-05-28 07:08:10] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 0 ms to minimize.
[2024-05-28 07:08:10] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 1 ms to minimize.
[2024-05-28 07:08:10] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 0 ms to minimize.
[2024-05-28 07:08:10] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 0 ms to minimize.
[2024-05-28 07:08:11] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 1 ms to minimize.
[2024-05-28 07:08:11] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 0 ms to minimize.
[2024-05-28 07:08:12] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2024-05-28 07:08:12] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2024-05-28 07:08:12] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2024-05-28 07:08:13] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 0 ms to minimize.
[2024-05-28 07:08:14] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2024-05-28 07:08:14] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2024-05-28 07:08:14] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 0 ms to minimize.
[2024-05-28 07:08:15] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2024-05-28 07:08:15] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 1 ms to minimize.
[2024-05-28 07:08:15] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2024-05-28 07:08:15] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 0 ms to minimize.
[2024-05-28 07:08:15] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2024-05-28 07:08:15] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2024-05-28 07:08:18] [INFO ] Trap strengthening (SAT) tested/added 75/75 trap constraints in 20442 ms
Current structural bounds on expressions (after SMT) : [5, 5, 5] Max seen :[1, 4, 1]
FORMULA Peterson-COL-4-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 495/495 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 285 transition count 459
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 249 transition count 459
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 249 transition count 395
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 185 transition count 395
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 165 transition count 375
Applied a total of 240 rules in 56 ms. Remains 165 /285 variables (removed 120) and now considering 375/495 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 165/285 places, 375/495 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 165 cols
[2024-05-28 07:08:19] [INFO ] Computed 19 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1492 ms. (steps per millisecond=670 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=1953 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=1912 ) properties (out of 2) seen :2
[2024-05-28 07:08:21] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2024-05-28 07:08:21] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 07:08:21] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 07:08:21] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-28 07:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:08:21] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-28 07:08:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:08:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 07:08:21] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-28 07:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:08:21] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-28 07:08:21] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 07:08:21] [INFO ] [Nat]Added 116 Read/Feed constraints in 17 ms returned sat
[2024-05-28 07:08:22] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:08:22] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-28 07:08:22] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:08:22] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:08:22] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:08:22] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:08:22] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2024-05-28 07:08:22] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:08:22] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-28 07:08:22] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-28 07:08:22] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:08:23] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:08:23] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-05-28 07:08:23] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:08:23] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:08:23] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:08:23] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:08:23] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:08:23] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:08:23] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-28 07:08:23] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2024-05-28 07:08:24] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:08:24] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:08:24] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:08:24] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2024-05-28 07:08:24] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-28 07:08:24] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:08:24] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:08:24] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2024-05-28 07:08:24] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:08:24] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2024-05-28 07:08:26] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2024-05-28 07:08:26] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:08:26] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:08:26] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:08:26] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-28 07:08:26] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-28 07:08:26] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:08:26] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 3 ms to minimize.
[2024-05-28 07:08:27] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2024-05-28 07:08:27] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 0 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:08:29] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:08:29] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:08:29] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:08:29] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:08:29] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2024-05-28 07:08:29] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:08:29] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:08:29] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:08:29] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:08:29] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2024-05-28 07:08:30] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:08:30] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:08:30] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:08:30] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:08:30] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2024-05-28 07:08:30] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:08:30] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:08:31] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:08:31] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:08:32] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:08:32] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:08:32] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:08:32] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2024-05-28 07:08:32] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:08:33] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2024-05-28 07:08:34] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:08:34] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:08:34] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:08:34] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:08:34] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:08:34] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-28 07:08:35] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:08:38] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:08:41] [INFO ] Trap strengthening (SAT) tested/added 96/96 trap constraints in 19121 ms
[2024-05-28 07:08:41] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 07:08:41] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-28 07:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:08:41] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-28 07:08:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:08:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 07:08:41] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-28 07:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:08:41] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-28 07:08:41] [INFO ] [Nat]Added 116 Read/Feed constraints in 17 ms returned sat
[2024-05-28 07:08:41] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:08:41] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-28 07:08:41] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:08:41] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:08:41] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 0 ms to minimize.
[2024-05-28 07:08:41] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:08:43] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:08:43] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:08:43] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-28 07:08:43] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:08:43] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:08:43] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:08:43] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:08:43] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-28 07:08:43] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:08:44] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:08:44] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 0 ms to minimize.
[2024-05-28 07:08:44] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:08:44] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:08:44] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-05-28 07:08:44] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:08:44] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:08:44] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:08:44] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:08:44] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:08:44] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:08:45] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2024-05-28 07:08:45] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:08:45] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:08:45] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2024-05-28 07:08:45] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:08:45] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:08:45] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2024-05-28 07:08:45] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2024-05-28 07:08:45] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:08:45] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:08:46] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:08:46] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:08:46] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:08:46] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-05-28 07:08:47] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:08:47] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:08:47] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2024-05-28 07:08:47] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:08:47] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:08:47] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:08:47] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:08:49] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:08:49] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:08:49] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-28 07:08:49] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:08:49] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-28 07:08:49] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:08:49] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:08:49] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:08:49] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:08:50] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:08:50] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:08:50] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:08:51] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-28 07:08:51] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:08:51] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:08:51] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:08:51] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-28 07:08:52] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2024-05-28 07:08:53] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:08:53] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:08:53] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:08:53] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:08:53] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:08:53] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:08:54] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:08:54] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:08:57] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:09:00] [INFO ] Trap strengthening (SAT) tested/added 96/96 trap constraints in 19072 ms
Current structural bounds on expressions (after SMT) : [5, 5] Max seen :[1, 1]
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 375/375 transitions.
Applied a total of 0 rules in 24 ms. Remains 165 /165 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 165/165 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 375/375 transitions.
Applied a total of 0 rules in 14 ms. Remains 165 /165 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-28 07:09:00] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-28 07:09:00] [INFO ] Invariant cache hit.
[2024-05-28 07:09:00] [INFO ] Implicit Places using invariants in 226 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 229 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/165 places, 375/375 transitions.
Applied a total of 0 rules in 14 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 257 ms. Remains : 160/165 places, 375/375 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2024-05-28 07:09:00] [INFO ] Computed 14 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1469 ms. (steps per millisecond=680 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 519 ms. (steps per millisecond=1926 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=1956 ) properties (out of 2) seen :2
[2024-05-28 07:09:03] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2024-05-28 07:09:03] [INFO ] Computed 14 invariants in 2 ms
[2024-05-28 07:09:03] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 07:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:09:03] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-28 07:09:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:09:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 07:09:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:09:03] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-28 07:09:03] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 07:09:03] [INFO ] [Nat]Added 116 Read/Feed constraints in 16 ms returned sat
[2024-05-28 07:09:03] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:09:03] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-28 07:09:03] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:03] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:04] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-28 07:09:04] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2024-05-28 07:09:04] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-05-28 07:09:04] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2024-05-28 07:09:04] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:09:04] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:09:04] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:09:04] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:09:04] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:09:04] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:09:04] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2024-05-28 07:09:05] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-05-28 07:09:05] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:09:05] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2024-05-28 07:09:05] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:09:05] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:09:05] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:09:05] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:09:05] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:09:05] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:09:06] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:06] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:09:06] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:09:06] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:06] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:09:06] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:09:06] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:06] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:09:06] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:09:06] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:06] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:07] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:07] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:07] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:09:07] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:09:07] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:09:07] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:09:07] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2024-05-28 07:09:07] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:09:07] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:09:07] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:09:08] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:08] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:08] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:08] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:08] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:09:08] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2024-05-28 07:09:08] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:09:08] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2024-05-28 07:09:08] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2024-05-28 07:09:09] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2024-05-28 07:09:09] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2024-05-28 07:09:09] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:09:09] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2024-05-28 07:09:09] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:09:09] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2024-05-28 07:09:10] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:09:10] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2024-05-28 07:09:11] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:09:11] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:09:11] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:09:11] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2024-05-28 07:09:11] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:09:11] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:09:11] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-05-28 07:09:11] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2024-05-28 07:09:11] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2024-05-28 07:09:11] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:09:11] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2024-05-28 07:09:11] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-05-28 07:09:12] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2024-05-28 07:09:12] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2024-05-28 07:09:12] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:09:12] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:09:12] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:09:12] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:09:12] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:09:12] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:09:12] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:09:13] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:09:14] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:09:14] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:09:14] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:09:14] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:09:15] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2024-05-28 07:09:15] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:09:15] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:09:15] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:09:15] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:09:15] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:09:15] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-05-28 07:09:16] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:09:16] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:09:16] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:09:18] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:09:21] [INFO ] Trap strengthening (SAT) tested/added 99/99 trap constraints in 17907 ms
[2024-05-28 07:09:21] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 07:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:09:21] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-28 07:09:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:09:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 07:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:09:21] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-28 07:09:21] [INFO ] [Nat]Added 116 Read/Feed constraints in 16 ms returned sat
[2024-05-28 07:09:21] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:09:21] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:22] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:09:22] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:09:22] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:09:22] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:09:22] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:09:22] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:09:22] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:09:22] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:22] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:09:22] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:09:22] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:09:23] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2024-05-28 07:09:23] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:09:23] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:09:23] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2024-05-28 07:09:23] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:09:23] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:09:23] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:09:23] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:09:23] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:09:24] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:09:24] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-28 07:09:24] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:09:24] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:24] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:09:24] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:09:24] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:09:24] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:24] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:24] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:09:24] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:09:25] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2024-05-28 07:09:25] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:09:25] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:09:25] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:09:25] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:09:25] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:09:25] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:09:25] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2024-05-28 07:09:25] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:09:25] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:09:25] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:09:26] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:09:26] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:26] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:09:26] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:26] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:26] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:26] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 3 ms to minimize.
[2024-05-28 07:09:26] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:09:26] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:09:27] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2024-05-28 07:09:27] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2024-05-28 07:09:27] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:09:27] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2024-05-28 07:09:27] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:09:27] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 0 ms to minimize.
[2024-05-28 07:09:27] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:09:28] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2024-05-28 07:09:28] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:09:29] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:09:29] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:09:29] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:09:29] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:09:29] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-05-28 07:09:29] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:09:29] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-28 07:09:29] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:09:29] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2024-05-28 07:09:30] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:09:30] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:09:30] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:09:30] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:09:30] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:09:30] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-28 07:09:30] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:09:30] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:09:30] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:09:30] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2024-05-28 07:09:31] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:09:31] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:09:31] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:09:32] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-28 07:09:32] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2024-05-28 07:09:33] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:09:33] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:09:33] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:09:33] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2024-05-28 07:09:33] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:09:33] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:09:33] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:09:33] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:09:34] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:09:34] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:09:34] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:09:35] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:09:36] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:09:39] [INFO ] Trap strengthening (SAT) tested/added 99/99 trap constraints in 17940 ms
Current structural bounds on expressions (after SMT) : [5, 5] Max seen :[1, 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 12 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 10 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-28 07:09:39] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-28 07:09:39] [INFO ] Invariant cache hit.
[2024-05-28 07:09:39] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-28 07:09:40] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-28 07:09:40] [INFO ] Invariant cache hit.
[2024-05-28 07:09:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 07:09:40] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-28 07:09:40] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-28 07:09:40] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-28 07:09:40] [INFO ] Invariant cache hit.
[2024-05-28 07:09:40] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 976 ms. Remains : 160/160 places, 375/375 transitions.
Starting property specific reduction for Peterson-COL-4-UpperBounds-02
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2024-05-28 07:09:40] [INFO ] Computed 14 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
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 :1
[2024-05-28 07:09:40] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2024-05-28 07:09:40] [INFO ] Computed 14 invariants in 1 ms
[2024-05-28 07:09:40] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 07:09:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:09:40] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-28 07:09:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:09:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 07:09:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:09:41] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-28 07:09:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 07:09:41] [INFO ] [Nat]Added 116 Read/Feed constraints in 16 ms returned sat
[2024-05-28 07:09:41] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:09:41] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:41] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-28 07:09:41] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:09:41] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:41] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:41] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:09:41] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2024-05-28 07:09:41] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:42] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:42] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:09:42] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:09:42] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:09:42] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2024-05-28 07:09:42] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:09:42] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-05-28 07:09:42] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:09:42] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:09:42] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2024-05-28 07:09:42] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2024-05-28 07:09:42] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:09:43] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:09:43] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:09:43] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:09:43] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:09:43] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:09:43] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:43] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:09:43] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:09:44] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-28 07:09:44] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2024-05-28 07:09:44] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:44] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:09:44] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:44] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:09:44] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:44] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:44] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:09:44] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:09:44] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:09:45] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:09:45] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:45] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:09:45] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:09:45] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:09:45] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:09:45] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-28 07:09:45] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:45] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:45] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:09:45] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 4841 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 9 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 9 ms. Remains : 160/160 places, 375/375 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2024-05-28 07:09:45] [INFO ] Computed 14 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1361 ms. (steps per millisecond=734 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=1988 ) properties (out of 1) seen :1
[2024-05-28 07:09:47] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2024-05-28 07:09:47] [INFO ] Computed 14 invariants in 2 ms
[2024-05-28 07:09:47] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 07:09:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:09:47] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-28 07:09:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:09:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 07:09:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:09:48] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-28 07:09:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 07:09:48] [INFO ] [Nat]Added 116 Read/Feed constraints in 16 ms returned sat
[2024-05-28 07:09:48] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:09:48] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:09:48] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:48] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:48] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:09:48] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:48] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:09:48] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:48] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:49] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:09:49] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:09:49] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:09:49] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:09:49] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:09:49] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:09:49] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:09:49] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:09:49] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:09:49] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:09:49] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2024-05-28 07:09:49] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:09:50] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:09:50] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:09:50] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:09:50] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:09:50] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:09:50] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:09:50] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:09:50] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:09:51] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:09:51] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-05-28 07:09:51] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:51] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:09:51] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:09:51] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:51] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:09:51] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:09:51] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:09:51] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:09:51] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:09:52] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:09:52] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:09:52] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:09:52] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:09:52] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:09:52] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:09:52] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:09:52] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:09:52] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:09:52] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:09:53] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2024-05-28 07:09:53] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:09:53] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:09:53] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:09:53] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2024-05-28 07:09:53] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2024-05-28 07:09:53] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2024-05-28 07:09:53] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:09:54] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2024-05-28 07:09:54] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2024-05-28 07:09:54] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:09:55] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2024-05-28 07:09:55] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2024-05-28 07:09:55] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:09:55] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2024-05-28 07:09:55] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:09:55] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:09:56] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:09:56] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-05-28 07:09:56] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-05-28 07:09:56] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:09:56] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:09:56] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2024-05-28 07:09:56] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2024-05-28 07:09:56] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2024-05-28 07:09:56] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-28 07:09:56] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:09:56] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:09:57] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:09:57] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-05-28 07:09:57] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:09:57] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:09:57] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-05-28 07:09:58] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:09:58] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:09:59] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:09:59] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2024-05-28 07:09:59] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:09:59] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:09:59] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:09:59] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:09:59] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:09:59] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:10:00] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:10:00] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:10:00] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:10:01] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:10:01] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:10:03] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:10:06] [INFO ] Trap strengthening (SAT) tested/added 99/99 trap constraints in 17863 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 7 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 8 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 7 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-28 07:10:06] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-28 07:10:06] [INFO ] Invariant cache hit.
[2024-05-28 07:10:06] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-28 07:10:06] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-28 07:10:06] [INFO ] Invariant cache hit.
[2024-05-28 07:10:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 07:10:06] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-28 07:10:06] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-28 07:10:06] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-28 07:10:06] [INFO ] Invariant cache hit.
[2024-05-28 07:10:06] [INFO ] Dead Transitions using invariants and state equation in 239 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-COL-4-UpperBounds-02 in 26176 ms.
Starting property specific reduction for Peterson-COL-4-UpperBounds-14
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2024-05-28 07:10:06] [INFO ] Computed 14 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
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 :1
[2024-05-28 07:10:06] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2024-05-28 07:10:06] [INFO ] Computed 14 invariants in 1 ms
[2024-05-28 07:10:07] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 07:10:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:10:07] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-28 07:10:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:10:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 07:10:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:10:07] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-28 07:10:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 07:10:07] [INFO ] [Nat]Added 116 Read/Feed constraints in 15 ms returned sat
[2024-05-28 07:10:07] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:10:07] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:10:07] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2024-05-28 07:10:07] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:10:07] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:10:07] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:10:07] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:10:07] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:10:08] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-28 07:10:08] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:10:08] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:10:08] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2024-05-28 07:10:08] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2024-05-28 07:10:08] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2024-05-28 07:10:08] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:10:08] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:10:08] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:10:08] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:10:08] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:10:09] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2024-05-28 07:10:09] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:10:09] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2024-05-28 07:10:09] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2024-05-28 07:10:09] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:10:09] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:10:09] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:10:09] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:10:09] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:10:10] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:10:10] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:10:10] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:10:10] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-28 07:10:10] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:10:10] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:10:10] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:10:10] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:10:10] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:10:10] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:10:10] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:10:11] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-05-28 07:10:11] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:10:11] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:10:11] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:10:11] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:10:11] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:10:11] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:10:11] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:10:11] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:10:11] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:10:12] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-28 07:10:12] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:10:12] [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 0
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.verifyPossible(DeadlockTester.java:919)
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:773)
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)
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 8 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 8 ms. Remains : 160/160 places, 375/375 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2024-05-28 07:10:12] [INFO ] Computed 14 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1355 ms. (steps per millisecond=738 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=2057 ) properties (out of 1) seen :1
[2024-05-28 07:10:14] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2024-05-28 07:10:14] [INFO ] Computed 14 invariants in 2 ms
[2024-05-28 07:10:14] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 07:10:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 07:10:14] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-28 07:10:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:10:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 07:10:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 07:10:14] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-28 07:10:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 07:10:14] [INFO ] [Nat]Added 116 Read/Feed constraints in 16 ms returned sat
[2024-05-28 07:10:14] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2024-05-28 07:10:14] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:10:14] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2024-05-28 07:10:14] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:10:14] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:10:14] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:10:14] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2024-05-28 07:10:15] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:10:15] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-28 07:10:15] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:10:15] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:10:15] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:10:15] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:10:15] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2024-05-28 07:10:15] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:10:15] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:10:15] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:10:15] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2024-05-28 07:10:15] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2024-05-28 07:10:16] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:10:16] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:10:16] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:10:16] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:10:16] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2024-05-28 07:10:16] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:10:16] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:10:16] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:10:17] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:10:17] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:10:17] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:10:17] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:10:17] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:10:17] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2024-05-28 07:10:17] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2024-05-28 07:10:17] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-28 07:10:17] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:10:17] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2024-05-28 07:10:17] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2024-05-28 07:10:18] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:10:18] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:10:18] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2024-05-28 07:10:18] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:10:18] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2024-05-28 07:10:18] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:10:18] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:10:18] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:10:18] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-28 07:10:18] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2024-05-28 07:10:19] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 0 ms to minimize.
[2024-05-28 07:10:19] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2024-05-28 07:10:19] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2024-05-28 07:10:19] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2024-05-28 07:10:19] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:10:19] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2024-05-28 07:10:19] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:10:19] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:10:19] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:10:20] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2024-05-28 07:10:20] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:10:20] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2024-05-28 07:10:20] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2024-05-28 07:10:21] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:10:21] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:10:21] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:10:22] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 0 ms to minimize.
[2024-05-28 07:10:22] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:10:22] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:10:22] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:10:22] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:10:22] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:10:22] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:10:22] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:10:22] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:10:22] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2024-05-28 07:10:22] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2024-05-28 07:10:22] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-05-28 07:10:22] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:10:23] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:10:23] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-05-28 07:10:23] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:10:23] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:10:23] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:10:23] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:10:24] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:10:25] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:10:25] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:10:25] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:10:25] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-05-28 07:10:25] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:10:25] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:10:25] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:10:26] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:10:26] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:10:26] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:10:26] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:10:26] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:10:27] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:10:27] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:10:29] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:10:32] [INFO ] Trap strengthening (SAT) tested/added 99/99 trap constraints in 17835 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 9 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 9 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 7 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-28 07:10:32] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-28 07:10:32] [INFO ] Invariant cache hit.
[2024-05-28 07:10:32] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-28 07:10:32] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-28 07:10:32] [INFO ] Invariant cache hit.
[2024-05-28 07:10:32] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 07:10:32] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-28 07:10:32] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-28 07:10:32] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-05-28 07:10:32] [INFO ] Invariant cache hit.
[2024-05-28 07:10:33] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 903 ms. Remains : 160/160 places, 375/375 transitions.
Ending property specific reduction for Peterson-COL-4-UpperBounds-14 in 26157 ms.
[2024-05-28 07:10:33] [INFO ] Flatten gal took : 104 ms
[2024-05-28 07:10:33] [INFO ] Applying decomposition
[2024-05-28 07:10:33] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16447408321429073006.txt' '-o' '/tmp/graph16447408321429073006.bin' '-w' '/tmp/graph16447408321429073006.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16447408321429073006.bin' '-l' '-1' '-v' '-w' '/tmp/graph16447408321429073006.weights' '-q' '0' '-e' '0.001'
[2024-05-28 07:10:33] [INFO ] Decomposing Gal with order
[2024-05-28 07:10:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 07:10:33] [INFO ] Removed a total of 411 redundant transitions.
[2024-05-28 07:10:33] [INFO ] Flatten gal took : 102 ms
[2024-05-28 07:10:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 297 labels/synchronizations in 26 ms.
[2024-05-28 07:10:33] [INFO ] Time to serialize gal into /tmp/UpperBounds5939770200366515060.gal : 12 ms
[2024-05-28 07:10:34] [INFO ] Time to serialize properties into /tmp/UpperBounds14129651166578318134.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5939770200366515060.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14129651166578318134.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 ...305
Loading property file /tmp/UpperBounds14129651166578318134.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.2132e+06,49.1801,973084,2,56260,5,3.58059e+06,6,0,1140,4.39052e+06,0
Total reachable state count : 4213200

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-COL-4-UpperBounds-02 :0 <= gi5.gi0.gu17.CS_0+gi5.gi1.gu20.CS_1+gi5.gi0.gu10.CS_2+gi5.gi0.gu22.CS_3+gi0.gu14.CS_4 <= 1
FORMULA Peterson-COL-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-COL-4-UpperBounds-02,0,49.1897,973084,1,0,7,3.58059e+06,9,1,1409,4.39052e+06,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-COL-4-UpperBounds-14 :0 <= gi5.gi0.gu17.CS_0+gi5.gi1.gu20.CS_1+gi5.gi0.gu10.CS_2+gi5.gi0.gu22.CS_3+gi0.gu14.CS_4 <= 1
FORMULA Peterson-COL-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-COL-4-UpperBounds-14,0,49.1925,973084,1,0,7,3.58059e+06,9,1,1409,4.39052e+06,4
Total runtime 255501 ms.

BK_STOP 1716880284430

--------------------
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-COL-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-COL-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-171654422000136"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-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 ;