MCC'2023- Execution of r234-tall-167856420000205

About the Execution of Marcie+red for JoinFreeModules-PT-0500

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
7648.972	353466.00	370554.00	1401.80	503 500 501 503 502 501 502 502 501 502 501 502 503 502 503 500	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420000205.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is JoinFreeModules-PT-0500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420000205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679461247091

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0500
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 05:00:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 05:00:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:00:48] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2023-03-22 05:00:48] [INFO ] Transformed 2501 places.
[2023-03-22 05:00:48] [INFO ] Transformed 4001 transitions.
[2023-03-22 05:00:48] [INFO ] Parsed PT model containing 2501 places and 4001 transitions and 11502 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 05:00:49] [INFO ] Computed 500 place invariants in 45 ms
Incomplete random walk after 10281 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=39 ) properties (out of 16) seen :1012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 16) seen :1016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 16) seen :1012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 16) seen :1016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 16) seen :1016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 16) seen :1016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 16) seen :1016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 16) seen :1013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 16) seen :1012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 16) seen :1016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 16) seen :1016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 16) seen :1016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 16) seen :1012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 16) seen :1016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 16) seen :1012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 16) seen :1016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 16) seen :1012
[2023-03-22 05:00:53] [INFO ] Invariant cache hit.
[2023-03-22 05:00:53] [INFO ] [Real]Absence check using 500 positive place invariants in 121 ms returned sat
[2023-03-22 05:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:00:54] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2023-03-22 05:00:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:00:55] [INFO ] [Nat]Absence check using 500 positive place invariants in 109 ms returned sat
[2023-03-22 05:00:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:00] [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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-22 05:01:00] [INFO ] [Real]Absence check using 500 positive place invariants in 108 ms returned sat
[2023-03-22 05:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:01] [INFO ] [Real]Absence check using state equation in 1348 ms returned sat
[2023-03-22 05:01:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:01:02] [INFO ] [Nat]Absence check using 500 positive place invariants in 111 ms returned sat
[2023-03-22 05:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:07] [INFO ] [Nat]Absence check using state equation in 4716 ms returned unknown
[2023-03-22 05:01:07] [INFO ] [Real]Absence check using 500 positive place invariants in 116 ms returned sat
[2023-03-22 05:01:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:08] [INFO ] [Real]Absence check using state equation in 1277 ms returned sat
[2023-03-22 05:01:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:01:09] [INFO ] [Nat]Absence check using 500 positive place invariants in 109 ms returned sat
[2023-03-22 05:01:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:13] [INFO ] [Nat]Absence check using state equation in 4669 ms returned unknown
[2023-03-22 05:01:14] [INFO ] [Real]Absence check using 500 positive place invariants in 99 ms returned sat
[2023-03-22 05:01:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:15] [INFO ] [Real]Absence check using state equation in 1261 ms returned sat
[2023-03-22 05:01:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:01:15] [INFO ] [Nat]Absence check using 500 positive place invariants in 114 ms returned sat
[2023-03-22 05:01:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:20] [INFO ] [Nat]Absence check using state equation in 4684 ms returned unknown
[2023-03-22 05:01:20] [INFO ] [Real]Absence check using 500 positive place invariants in 100 ms returned sat
[2023-03-22 05:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:22] [INFO ] [Real]Absence check using state equation in 1236 ms returned sat
[2023-03-22 05:01:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:01:22] [INFO ] [Nat]Absence check using 500 positive place invariants in 108 ms returned sat
[2023-03-22 05:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:27] [INFO ] [Nat]Absence check using state equation in 4690 ms returned unknown
[2023-03-22 05:01:27] [INFO ] [Real]Absence check using 500 positive place invariants in 102 ms returned sat
[2023-03-22 05:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:28] [INFO ] [Real]Absence check using state equation in 1256 ms returned sat
[2023-03-22 05:01:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:01:29] [INFO ] [Nat]Absence check using 500 positive place invariants in 102 ms returned sat
[2023-03-22 05:01:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:34] [INFO ] [Nat]Absence check using state equation in 4702 ms returned unknown
[2023-03-22 05:01:34] [INFO ] [Real]Absence check using 500 positive place invariants in 99 ms returned sat
[2023-03-22 05:01:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:35] [INFO ] [Real]Absence check using state equation in 1216 ms returned sat
[2023-03-22 05:01:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:01:36] [INFO ] [Nat]Absence check using 500 positive place invariants in 107 ms returned sat
[2023-03-22 05:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:40] [INFO ] [Nat]Absence check using state equation in 4692 ms returned unknown
[2023-03-22 05:01:41] [INFO ] [Real]Absence check using 500 positive place invariants in 104 ms returned sat
[2023-03-22 05:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:42] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2023-03-22 05:01:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:01:42] [INFO ] [Nat]Absence check using 500 positive place invariants in 102 ms returned sat
[2023-03-22 05:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:47] [INFO ] [Nat]Absence check using state equation in 4699 ms returned unknown
[2023-03-22 05:01:47] [INFO ] [Real]Absence check using 500 positive place invariants in 102 ms returned sat
[2023-03-22 05:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:49] [INFO ] [Real]Absence check using state equation in 1275 ms returned sat
[2023-03-22 05:01:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:01:49] [INFO ] [Nat]Absence check using 500 positive place invariants in 102 ms returned sat
[2023-03-22 05:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:54] [INFO ] [Nat]Absence check using state equation in 4701 ms returned unknown
[2023-03-22 05:01:54] [INFO ] [Real]Absence check using 500 positive place invariants in 102 ms returned sat
[2023-03-22 05:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:01:55] [INFO ] [Real]Absence check using state equation in 1253 ms returned sat
[2023-03-22 05:01:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:01:56] [INFO ] [Nat]Absence check using 500 positive place invariants in 105 ms returned sat
[2023-03-22 05:01:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:00] [INFO ] [Nat]Absence check using state equation in 4693 ms returned unknown
[2023-03-22 05:02:01] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-22 05:02:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:02] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2023-03-22 05:02:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:02:02] [INFO ] [Nat]Absence check using 500 positive place invariants in 111 ms returned sat
[2023-03-22 05:02:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:07] [INFO ] [Nat]Absence check using state equation in 4728 ms returned unknown
[2023-03-22 05:02:07] [INFO ] [Real]Absence check using 500 positive place invariants in 99 ms returned sat
[2023-03-22 05:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:09] [INFO ] [Real]Absence check using state equation in 1191 ms returned sat
[2023-03-22 05:02:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:02:09] [INFO ] [Nat]Absence check using 500 positive place invariants in 111 ms returned sat
[2023-03-22 05:02:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:14] [INFO ] [Nat]Absence check using state equation in 4701 ms returned unknown
[2023-03-22 05:02:14] [INFO ] [Real]Absence check using 500 positive place invariants in 100 ms returned sat
[2023-03-22 05:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:15] [INFO ] [Real]Absence check using state equation in 1238 ms returned sat
[2023-03-22 05:02:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:02:16] [INFO ] [Nat]Absence check using 500 positive place invariants in 102 ms returned sat
[2023-03-22 05:02:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:21] [INFO ] [Nat]Absence check using state equation in 4701 ms returned unknown
[2023-03-22 05:02:21] [INFO ] [Real]Absence check using 500 positive place invariants in 100 ms returned sat
[2023-03-22 05:02:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:22] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2023-03-22 05:02:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:02:23] [INFO ] [Nat]Absence check using 500 positive place invariants in 107 ms returned sat
[2023-03-22 05:02:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:27] [INFO ] [Nat]Absence check using state equation in 4703 ms returned unknown
[2023-03-22 05:02:28] [INFO ] [Real]Absence check using 500 positive place invariants in 99 ms returned sat
[2023-03-22 05:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:29] [INFO ] [Real]Absence check using state equation in 1210 ms returned sat
[2023-03-22 05:02:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:02:29] [INFO ] [Nat]Absence check using 500 positive place invariants in 106 ms returned sat
[2023-03-22 05:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:34] [INFO ] [Nat]Absence check using state equation in 4720 ms returned unknown
[2023-03-22 05:02:34] [INFO ] [Real]Absence check using 500 positive place invariants in 102 ms returned sat
[2023-03-22 05:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:35] [INFO ] [Real]Absence check using state equation in 1235 ms returned sat
[2023-03-22 05:02:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:02:36] [INFO ] [Nat]Absence check using 500 positive place invariants in 101 ms returned sat
[2023-03-22 05:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:41] [INFO ] [Nat]Absence check using state equation in 4693 ms returned unknown
Current structural bounds on expressions (after SMT) : [503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503] Max seen :[4, 500, 5, 4, 4, 5, 2, 2, 5, 4, 5, 2, 4, 2, 4, 500]
Support contains 16 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 80 are kept as prefixes of interest. Removing 2420 places using SCC suffix rule.7 ms
Discarding 2420 places :
Also discarding 3872 output transitions
Drop transitions removed 3872 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 41 ms. Remains 80 /2500 variables (removed 2420) and now considering 128/4001 (removed 3873) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-22 05:02:41] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-22 05:02:41] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 80/2500 places, 128/4001 transitions.
[2023-03-22 05:02:41] [INFO ] Invariant cache hit.
Incomplete random walk after 1000050 steps, including 2 resets, run finished after 967 ms. (steps per millisecond=1034 ) properties (out of 16) seen :7919
FORMULA JoinFreeModules-PT-0500-UpperBounds-12 503 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1126 ms. (steps per millisecond=888 ) properties (out of 15) seen :1897
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1137 ms. (steps per millisecond=879 ) properties (out of 15) seen :1410
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1099 ms. (steps per millisecond=909 ) properties (out of 15) seen :1829
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1152 ms. (steps per millisecond=868 ) properties (out of 15) seen :1865
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1112 ms. (steps per millisecond=899 ) properties (out of 15) seen :1811
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1100 ms. (steps per millisecond=909 ) properties (out of 15) seen :1825
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1139 ms. (steps per millisecond=877 ) properties (out of 15) seen :1489
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1126 ms. (steps per millisecond=888 ) properties (out of 15) seen :1494
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 15) seen :1827
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1140 ms. (steps per millisecond=877 ) properties (out of 15) seen :1811
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1096 ms. (steps per millisecond=912 ) properties (out of 15) seen :1869
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1131 ms. (steps per millisecond=884 ) properties (out of 15) seen :1491
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1122 ms. (steps per millisecond=891 ) properties (out of 15) seen :1481
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1116 ms. (steps per millisecond=896 ) properties (out of 15) seen :1866
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties (out of 15) seen :1396
[2023-03-22 05:02:58] [INFO ] Invariant cache hit.
[2023-03-22 05:02:59] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:02:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:59] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:02:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:02:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:02:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:59] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-22 05:02:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 05:02:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-22 05:02:59] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-22 05:02:59] [INFO ] Added : 39 causal constraints over 9 iterations in 142 ms. Result :sat
Minimization took 47 ms.
[2023-03-22 05:02:59] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:02:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:59] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 05:02:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:02:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:02:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:59] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-22 05:02:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:02:59] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-22 05:02:59] [INFO ] Added : 20 causal constraints over 6 iterations in 75 ms. Result :sat
Minimization took 33 ms.
[2023-03-22 05:02:59] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:02:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:59] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:02:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:02:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:02:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:02:59] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-22 05:02:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 12 ms returned sat
[2023-03-22 05:02:59] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 05:02:59] [INFO ] Added : 35 causal constraints over 8 iterations in 103 ms. Result :sat
Minimization took 53 ms.
[2023-03-22 05:03:00] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:00] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:03:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:00] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-22 05:03:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:03:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:03:00] [INFO ] Added : 37 causal constraints over 9 iterations in 90 ms. Result :sat
Minimization took 52 ms.
[2023-03-22 05:03:00] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:03:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:00] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-22 05:03:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:03:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 28 ms.
[2023-03-22 05:03:00] [INFO ] Added : 34 causal constraints over 9 iterations in 206 ms. Result :sat
Minimization took 61 ms.
[2023-03-22 05:03:00] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:00] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 05:03:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:01] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 05:03:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:03:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 5 ms to minimize.
[2023-03-22 05:03:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-22 05:03:01] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-22 05:03:01] [INFO ] Added : 28 causal constraints over 6 iterations in 113 ms. Result :sat
Minimization took 38 ms.
[2023-03-22 05:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:01] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-22 05:03:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:01] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-22 05:03:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 49 ms returned sat
[2023-03-22 05:03:01] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 05:03:01] [INFO ] Added : 33 causal constraints over 7 iterations in 111 ms. Result :sat
Minimization took 35 ms.
[2023-03-22 05:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:03:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:01] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-22 05:03:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-22 05:03:01] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:03:01] [INFO ] Added : 26 causal constraints over 6 iterations in 91 ms. Result :sat
Minimization took 58 ms.
[2023-03-22 05:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:01] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 05:03:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:02] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-22 05:03:02] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:03:02] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:03:02] [INFO ] Added : 28 causal constraints over 6 iterations in 65 ms. Result :sat
Minimization took 49 ms.
[2023-03-22 05:03:02] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:02] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:03:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:02] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-22 05:03:02] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-22 05:03:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-22 05:03:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-22 05:03:02] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:03:02] [INFO ] Added : 26 causal constraints over 6 iterations in 66 ms. Result :sat
Minimization took 76 ms.
[2023-03-22 05:03:02] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-22 05:03:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:02] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 05:03:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:02] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 05:03:02] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:03:02] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:03:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-22 05:03:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-22 05:03:02] [INFO ] Added : 38 causal constraints over 9 iterations in 155 ms. Result :sat
Minimization took 44 ms.
[2023-03-22 05:03:03] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:03:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:03] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-22 05:03:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:03:03] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:03:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2023-03-22 05:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-22 05:03:03] [INFO ] Added : 37 causal constraints over 8 iterations in 197 ms. Result :sat
Minimization took 43 ms.
[2023-03-22 05:03:03] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:03] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 05:03:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:03] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 05:03:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:03:03] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-22 05:03:03] [INFO ] Added : 28 causal constraints over 7 iterations in 106 ms. Result :sat
Minimization took 36 ms.
[2023-03-22 05:03:03] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:03] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:03:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:03] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-22 05:03:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:03:03] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:03:04] [INFO ] Added : 36 causal constraints over 8 iterations in 101 ms. Result :sat
Minimization took 48 ms.
[2023-03-22 05:03:04] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:04] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:03:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:04] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-22 05:03:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:03:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 05:03:04] [INFO ] Added : 34 causal constraints over 7 iterations in 146 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503] Max seen :[500, 500, 501, 501, 488, 501, 496, 482, 501, 485, 501, 485, 474, 501, 500]
FORMULA JoinFreeModules-PT-0500-UpperBounds-03 503 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0500-UpperBounds-00 503 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 13 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 65 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 4 ms. Remains 65 /80 variables (removed 15) and now considering 104/128 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 65/80 places, 104/128 transitions.
// Phase 1: matrix 104 rows 65 cols
[2023-03-22 05:03:06] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 1000072 steps, including 2 resets, run finished after 776 ms. (steps per millisecond=1288 ) properties (out of 13) seen :6414
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 13) seen :1512
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties (out of 13) seen :1865
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 961 ms. (steps per millisecond=1040 ) properties (out of 13) seen :1886
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 923 ms. (steps per millisecond=1083 ) properties (out of 13) seen :1904
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 963 ms. (steps per millisecond=1038 ) properties (out of 13) seen :1514
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 953 ms. (steps per millisecond=1049 ) properties (out of 13) seen :1571
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 13) seen :1906
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 961 ms. (steps per millisecond=1040 ) properties (out of 13) seen :1908
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 908 ms. (steps per millisecond=1101 ) properties (out of 13) seen :1874
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 970 ms. (steps per millisecond=1030 ) properties (out of 13) seen :1563
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 963 ms. (steps per millisecond=1038 ) properties (out of 13) seen :1575
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 932 ms. (steps per millisecond=1072 ) properties (out of 13) seen :2001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 942 ms. (steps per millisecond=1061 ) properties (out of 13) seen :1506
[2023-03-22 05:03:19] [INFO ] Invariant cache hit.
[2023-03-22 05:03:19] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:19] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 05:03:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:19] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 05:03:19] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-22 05:03:19] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:03:19] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 05:03:20] [INFO ] Added : 34 causal constraints over 9 iterations in 80 ms. Result :sat
Minimization took 31 ms.
[2023-03-22 05:03:20] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:20] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 05:03:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:20] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-22 05:03:20] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:03:20] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:03:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-22 05:03:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-22 05:03:20] [INFO ] Added : 38 causal constraints over 9 iterations in 131 ms. Result :sat
Minimization took 32 ms.
[2023-03-22 05:03:20] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:20] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 05:03:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:20] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-22 05:03:20] [INFO ] [Nat]Added 13 Read/Feed constraints in 26 ms returned sat
[2023-03-22 05:03:20] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:03:20] [INFO ] Added : 45 causal constraints over 9 iterations in 125 ms. Result :sat
Minimization took 39 ms.
[2023-03-22 05:03:20] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:20] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:03:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:20] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-22 05:03:20] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:03:20] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:03:20] [INFO ] Added : 36 causal constraints over 8 iterations in 104 ms. Result :sat
Minimization took 32 ms.
[2023-03-22 05:03:21] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:21] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:03:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:21] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:03:21] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-22 05:03:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-22 05:03:21] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:21] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:03:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:21] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:03:21] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-22 05:03:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-22 05:03:21] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:21] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 05:03:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:21] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:03:21] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-22 05:03:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-22 05:03:21] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:03:21] [INFO ] Added : 22 causal constraints over 5 iterations in 49 ms. Result :sat
Minimization took 28 ms.
[2023-03-22 05:03:21] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:21] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 05:03:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:21] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:03:21] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-22 05:03:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-22 05:03:21] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:21] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:03:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:21] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-22 05:03:21] [INFO ] [Nat]Added 13 Read/Feed constraints in 25 ms returned sat
[2023-03-22 05:03:21] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 05:03:22] [INFO ] Added : 29 causal constraints over 6 iterations in 177 ms. Result :sat
Minimization took 43 ms.
[2023-03-22 05:03:22] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-22 05:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:22] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 05:03:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:22] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 05:03:22] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:03:22] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-22 05:03:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:03:22] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:03:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:22] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-22 05:03:22] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2023-03-22 05:03:22] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-22 05:03:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-22 05:03:22] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 05:03:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:22] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-22 05:03:22] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2023-03-22 05:03:22] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:03:22] [INFO ] Added : 39 causal constraints over 9 iterations in 110 ms. Result :sat
Minimization took 40 ms.
[2023-03-22 05:03:22] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 05:03:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:23] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-22 05:03:23] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2023-03-22 05:03:23] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:03:23] [INFO ] Added : 35 causal constraints over 7 iterations in 112 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [503, 503, 503, 503, 502, 502, 503, 502, 503, 502, 502, 503, 503] Max seen :[500, 501, 501, 501, 502, 502, 501, 502, 501, 502, 502, 501, 500]
FORMULA JoinFreeModules-PT-0500-UpperBounds-13 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-UpperBounds-11 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-UpperBounds-09 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-UpperBounds-07 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-UpperBounds-06 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 40 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Applied a total of 1 rules in 9 ms. Remains 40 /65 variables (removed 25) and now considering 64/104 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 40/65 places, 64/104 transitions.
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 05:03:23] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 1000045 steps, including 2 resets, run finished after 481 ms. (steps per millisecond=2079 ) properties (out of 8) seen :4004
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 581 ms. (steps per millisecond=1721 ) properties (out of 8) seen :1926
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 585 ms. (steps per millisecond=1709 ) properties (out of 8) seen :2221
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 8) seen :2337
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 569 ms. (steps per millisecond=1757 ) properties (out of 8) seen :2192
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 8) seen :2284
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 8) seen :2241
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties (out of 8) seen :2412
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 593 ms. (steps per millisecond=1686 ) properties (out of 8) seen :1911
[2023-03-22 05:03:28] [INFO ] Invariant cache hit.
[2023-03-22 05:03:28] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 05:03:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:28] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 05:03:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 05:03:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:03:29] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:03:29] [INFO ] Added : 15 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 05:03:29] [INFO ] [Real]Absence check using 8 positive place invariants in 30 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:29] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 05:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:29] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:03:29] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:03:29] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-22 05:03:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-22 05:03:29] [INFO ] Added : 16 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 19 ms.
[2023-03-22 05:03:29] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 05:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:29] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:03:29] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:03:29] [INFO ] Added : 17 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 05:03:29] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 05:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:29] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:03:29] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:03:29] [INFO ] Added : 14 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 05:03:29] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:29] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 05:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:29] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:03:29] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 05:03:29] [INFO ] Added : 16 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 05:03:29] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 05:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:29] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-22 05:03:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:03:29] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:03:29] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2023-03-22 05:03:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-03-22 05:03:29] [INFO ] Added : 17 causal constraints over 4 iterations in 64 ms. Result :sat
Minimization took 14 ms.
[2023-03-22 05:03:30] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:30] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 05:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:30] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:03:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-22 05:03:30] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:03:30] [INFO ] Added : 22 causal constraints over 6 iterations in 32 ms. Result :sat
Minimization took 14 ms.
[2023-03-22 05:03:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:30] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 05:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:30] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 05:03:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:03:30] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:03:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-22 05:03:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-22 05:03:30] [INFO ] Added : 21 causal constraints over 5 iterations in 117 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [503, 503, 503, 503, 503, 503, 503, 503] Max seen :[500, 501, 501, 501, 501, 501, 502, 500]
Support contains 8 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 8 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 40/40 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-22 05:03:30] [INFO ] Invariant cache hit.
[2023-03-22 05:03:30] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 05:03:30] [INFO ] Invariant cache hit.
[2023-03-22 05:03:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 05:03:30] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-22 05:03:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 05:03:30] [INFO ] Invariant cache hit.
[2023-03-22 05:03:30] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 40/40 places, 64/64 transitions.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-01
[2023-03-22 05:03:30] [INFO ] Invariant cache hit.
Incomplete random walk after 10483 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2096 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :500
[2023-03-22 05:03:30] [INFO ] Invariant cache hit.
[2023-03-22 05:03:30] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:30] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 05:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:30] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-22 05:03:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 05:03:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:03:30] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:03:30] [INFO ] Added : 15 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 05:03:30] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 05:03:31] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 05:03:31] [INFO ] Invariant cache hit.
Incomplete random walk after 1000230 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=8930 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7092 ) properties (out of 1) seen :500
[2023-03-22 05:03:31] [INFO ] Invariant cache hit.
[2023-03-22 05:03:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:03:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:31] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 05:03:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:03:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:31] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:03:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2023-03-22 05:03:31] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:03:31] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 05:03:31] [INFO ] Invariant cache hit.
[2023-03-22 05:03:31] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 05:03:31] [INFO ] Invariant cache hit.
[2023-03-22 05:03:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:31] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-22 05:03:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:03:31] [INFO ] Invariant cache hit.
[2023-03-22 05:03:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-01 in 609 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-02
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 05:03:31] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 10036 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1254 ) properties (out of 1) seen :250
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 :187
[2023-03-22 05:03:31] [INFO ] Invariant cache hit.
[2023-03-22 05:03:31] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:31] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 05:03:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:31] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-22 05:03:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 05:03:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:03:31] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:03:31] [INFO ] Added : 14 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[250]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 05:03:31] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 05:03:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 05:03:31] [INFO ] Invariant cache hit.
Incomplete random walk after 1000238 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=9348 ) properties (out of 1) seen :501
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=4716 ) properties (out of 1) seen :501
[2023-03-22 05:03:32] [INFO ] Invariant cache hit.
[2023-03-22 05:03:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:32] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 05:03:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:03:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:32] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-22 05:03:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 05:03:32] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 05:03:32] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 05:03:32] [INFO ] Invariant cache hit.
[2023-03-22 05:03:32] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-22 05:03:32] [INFO ] Invariant cache hit.
[2023-03-22 05:03:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:32] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-22 05:03:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:03:32] [INFO ] Invariant cache hit.
[2023-03-22 05:03:32] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-02 in 753 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-04
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 05:03:32] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 10018 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1431 ) properties (out of 1) seen :250
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :168
[2023-03-22 05:03:32] [INFO ] Invariant cache hit.
[2023-03-22 05:03:32] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:32] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 05:03:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:32] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-22 05:03:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 05:03:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:03:32] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:03:32] [INFO ] Added : 11 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[250]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 05:03:32] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 05:03:32] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 05:03:32] [INFO ] Invariant cache hit.
Incomplete random walk after 1000063 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=8621 ) properties (out of 1) seen :498
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=7299 ) properties (out of 1) seen :499
[2023-03-22 05:03:32] [INFO ] Invariant cache hit.
[2023-03-22 05:03:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:32] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 05:03:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:32] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 05:03:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:03:32] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:03:32] [INFO ] Added : 4 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[499]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 05:03:32] [INFO ] Invariant cache hit.
[2023-03-22 05:03:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 05:03:32] [INFO ] Invariant cache hit.
[2023-03-22 05:03:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:33] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-22 05:03:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:03:33] [INFO ] Invariant cache hit.
[2023-03-22 05:03:33] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-22 05:03:33] [INFO ] Invariant cache hit.
Incomplete random walk after 1000029 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=9091 ) properties (out of 1) seen :496
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=6849 ) properties (out of 1) seen :500
[2023-03-22 05:03:33] [INFO ] Invariant cache hit.
[2023-03-22 05:03:33] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 05:03:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 05:03:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:03:33] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:03:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-22 05:03:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-03-22 05:03:33] [INFO ] Added : 5 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 05:03:33] [INFO ] Invariant cache hit.
[2023-03-22 05:03:33] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 05:03:33] [INFO ] Invariant cache hit.
[2023-03-22 05:03:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:33] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-22 05:03:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:03:33] [INFO ] Invariant cache hit.
[2023-03-22 05:03:33] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-04 in 1309 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-05
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 05:03:33] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 10477 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1746 ) properties (out of 1) seen :501
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :187
[2023-03-22 05:03:33] [INFO ] Invariant cache hit.
[2023-03-22 05:03:33] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:33] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 05:03:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:33] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 05:03:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 05:03:33] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:03:33] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:03:33] [INFO ] Added : 14 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 05:03:33] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 05:03:33] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 05:03:33] [INFO ] Invariant cache hit.
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=9174 ) properties (out of 1) seen :501
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=6134 ) properties (out of 1) seen :501
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
[2023-03-22 05:03:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:34] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 05:03:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:34] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:03:34] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:03:34] [INFO ] Added : 6 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
[2023-03-22 05:03:34] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
[2023-03-22 05:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:34] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-22 05:03:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
[2023-03-22 05:03:34] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-05 in 720 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-08
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 05:03:34] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 10072 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1438 ) properties (out of 1) seen :501
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :187
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
[2023-03-22 05:03:34] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:34] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 05:03:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:34] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-22 05:03:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 05:03:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:03:34] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:03:34] [INFO ] Added : 16 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 05:03:34] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 05:03:34] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000053 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=8547 ) properties (out of 1) seen :501
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=6535 ) properties (out of 1) seen :501
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
[2023-03-22 05:03:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:34] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 05:03:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:34] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:03:34] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 05:03:34] [INFO ] Added : 6 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
[2023-03-22 05:03:34] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
[2023-03-22 05:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-22 05:03:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
[2023-03-22 05:03:34] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-08 in 710 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-10
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 05:03:34] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10099 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2019 ) properties (out of 1) seen :501
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 :187
[2023-03-22 05:03:34] [INFO ] Invariant cache hit.
[2023-03-22 05:03:34] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:34] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 05:03:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:35] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 05:03:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 05:03:35] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:03:35] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:03:35] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-22 05:03:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-03-22 05:03:35] [INFO ] Added : 17 causal constraints over 4 iterations in 72 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 05:03:35] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 05:03:35] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 05:03:35] [INFO ] Invariant cache hit.
Incomplete random walk after 1000016 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=9345 ) properties (out of 1) seen :501
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=6451 ) properties (out of 1) seen :501
[2023-03-22 05:03:35] [INFO ] Invariant cache hit.
[2023-03-22 05:03:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:35] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 05:03:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:35] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 05:03:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 05:03:35] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:03:35] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 05:03:35] [INFO ] Invariant cache hit.
[2023-03-22 05:03:35] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 05:03:35] [INFO ] Invariant cache hit.
[2023-03-22 05:03:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:35] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-22 05:03:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:03:35] [INFO ] Invariant cache hit.
[2023-03-22 05:03:35] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-10 in 681 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-14
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 05:03:35] [INFO ] Computed 8 place invariants in 3 ms
Incomplete random walk after 10026 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1253 ) properties (out of 1) seen :250
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :288
[2023-03-22 05:03:35] [INFO ] Invariant cache hit.
[2023-03-22 05:03:35] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:35] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 05:03:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:35] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-22 05:03:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 05:03:35] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:03:35] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:03:35] [INFO ] Added : 16 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[288]
FORMULA JoinFreeModules-PT-0500-UpperBounds-14 503 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-14 in 297 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-15
[2023-03-22 05:03:35] [INFO ] Invariant cache hit.
Incomplete random walk after 10143 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2028 ) properties (out of 1) seen :500
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 :500
[2023-03-22 05:03:35] [INFO ] Invariant cache hit.
[2023-03-22 05:03:35] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:35] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 05:03:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 05:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:36] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 05:03:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 05:03:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:03:36] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:03:36] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2023-03-22 05:03:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-03-22 05:03:36] [INFO ] Added : 21 causal constraints over 5 iterations in 117 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 05:03:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 05:03:36] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 05:03:36] [INFO ] Invariant cache hit.
Incomplete random walk after 1000053 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=8621 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=7042 ) properties (out of 1) seen :500
[2023-03-22 05:03:36] [INFO ] Invariant cache hit.
[2023-03-22 05:03:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:36] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:03:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:03:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:03:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:03:36] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:03:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:03:36] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:03:36] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 05:03:36] [INFO ] Invariant cache hit.
[2023-03-22 05:03:36] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 05:03:36] [INFO ] Invariant cache hit.
[2023-03-22 05:03:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:03:36] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-22 05:03:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:03:36] [INFO ] Invariant cache hit.
[2023-03-22 05:03:36] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-15 in 697 ms.
[2023-03-22 05:03:36] [INFO ] Flatten gal took : 45 ms
[2023-03-22 05:03:36] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/UpperBounds.sr.xml took 7 ms.
[2023-03-22 05:03:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 64 transitions and 168 arcs took 1 ms.
Total runtime 168290 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: JoinFreeModules_PT_0500
(NrP: 40 NrTr: 64 NrArc: 168)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.688sec

RS generation: 2m57.573sec

-> reachability set: #nodes 20168 (2.0e+04) #states 3,001,491,916,463,059,389,990,784,965,101,405,523,525,556,785,718,010,201,404,976,388,992,100,000,000 (75)

starting MCC model checker
--------------------------

checking: place_bound(p2)
normalized: place_bound(p2)

-> the formula is 500

FORMULA JoinFreeModules-PT-0500-UpperBounds-01 500 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p21)
normalized: place_bound(p21)

-> the formula is 501

FORMULA JoinFreeModules-PT-0500-UpperBounds-02 501 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p28)
normalized: place_bound(p28)

-> the formula is 502

FORMULA JoinFreeModules-PT-0500-UpperBounds-04 502 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p36)
normalized: place_bound(p36)

-> the formula is 501

FORMULA JoinFreeModules-PT-0500-UpperBounds-05 501 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p11)
normalized: place_bound(p11)

-> the formula is 501

FORMULA JoinFreeModules-PT-0500-UpperBounds-08 501 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p31)
normalized: place_bound(p31)

-> the formula is 501

FORMULA JoinFreeModules-PT-0500-UpperBounds-10 501 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p17)
normalized: place_bound(p17)

-> the formula is 500

FORMULA JoinFreeModules-PT-0500-UpperBounds-15 500 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 920352 (9.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 220147649 3037230 223184879
used/not used/entry size/cache size: 3426559 63682305 16 1024MB
basic ops cache: hits/miss/sum: 67382 28551 95933
used/not used/entry size/cache size: 41993 16735223 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 4071340 20168 4091508
used/not used/entry size/cache size: 20142 8368466 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66325471
1 705865
2 58191
3 15060
4 300
5 9
6 0
7 0
8 8
9 0
>= 10 3960

Total processing time: 3m 2.777sec

BK_STOP 1679461600557

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok

initing FirstDep: 0m 0.000sec

iterations count:80112 (1251), effective:29768 (465)

initing FirstDep: 0m 0.000sec

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="JoinFreeModules-PT-0500"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is JoinFreeModules-PT-0500, 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 r234-tall-167856420000205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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