MCC'2025- Execution of r167-tall-174881266100064

About the Execution of 2024-gold for PolyORBLF-PT-S06J04T04

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15683.750	1883546.00	2350540.00	6855.60	1 5 3 1 2 1 4 1 1 1 1 ? 1 4 1 1	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266100064.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is PolyORBLF-PT-S06J04T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100064
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 340K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 109K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 382K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 293K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 6.8M May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748893251211

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 19:40:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:40:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:40:52] [INFO ] Load time of PNML (sax parser for PT used): 403 ms
[2025-06-02 19:40:52] [INFO ] Transformed 454 places.
[2025-06-02 19:40:52] [INFO ] Transformed 6994 transitions.
[2025-06-02 19:40:52] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 553 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 19:40:53] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2025-06-02 19:40:53] [INFO ] Computed 50 invariants in 124 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[6780, 138, 12, 6780, 2, 60, 6612, 31, 1695, 31, 42, 1695, 1695, 3348, 1, 6]
RANDOM walk for 10000 steps (35 resets) in 164 ms. (60 steps per ms)
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140008 steps (344 resets) in 522 ms. (267 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 5, 3, 1, 1, 4, 1, 1, 1, 1, 1, 1, 4, 1] Max Struct:[6780, 138, 12, 6780, 60, 6612, 31, 1695, 31, 42, 1695, 1695, 3348, 6]
[2025-06-02 19:40:53] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2025-06-02 19:40:53] [INFO ] Invariant cache hit.
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned unsat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 4 ms returned unsat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned unsat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned unsat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned unsat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 7 ms returned unsat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 19:40:54] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned sat
[2025-06-02 19:40:55] [INFO ] [Real]Absence check using state equation in 1122 ms returned sat
[2025-06-02 19:40:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:40:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 19:40:56] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned sat
[2025-06-02 19:40:58] [INFO ] [Nat]Absence check using state equation in 2000 ms returned sat
[2025-06-02 19:40:58] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:40:58] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:40:58] [INFO ] [Nat]Added 112 Read/Feed constraints in 552 ms returned sat
[2025-06-02 19:40:58] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 15 ms to minimize.
[2025-06-02 19:40:59] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 689 ms
[2025-06-02 19:40:59] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 19:40:59] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 6 ms returned unsat
[2025-06-02 19:40:59] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 19:40:59] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 5 ms returned unsat
[2025-06-02 19:40:59] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 19:40:59] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned sat
[2025-06-02 19:41:01] [INFO ] [Real]Absence check using state equation in 1672 ms returned sat
[2025-06-02 19:41:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:41:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 19:41:01] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2025-06-02 19:41:03] [INFO ] [Nat]Absence check using state equation in 1813 ms returned sat
[2025-06-02 19:41:03] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:41:04] [INFO ] [Nat]Added 112 Read/Feed constraints in 1036 ms returned unknown
[2025-06-02 19:41:04] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 19:41:04] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2025-06-02 19:41:04] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 19:41:04] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned unsat
[2025-06-02 19:41:04] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-06-02 19:41:04] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 5, 3, 1, 1, 4, 1, 1, 1, 1, 1, 1, 4, 1] Max Struct:[1, 5, 3, 1, 1, 4, 1, 1695, 1, 1, 1695, 1, 4, 1]
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[1695, 1695]
Support contains 2 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 448 transition count 1579
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 76 place count 413 transition count 1579
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 76 place count 413 transition count 1531
Deduced a syphon composed of 48 places in 5 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 172 place count 365 transition count 1531
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 266 place count 318 transition count 1484
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 274 place count 318 transition count 1476
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 282 place count 310 transition count 1476
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 283 place count 310 transition count 1476
Applied a total of 283 rules in 341 ms. Remains 310 /454 variables (removed 144) and now considering 1476/1614 (removed 138) transitions.
Running 1470 sub problems to find dead transitions.
[2025-06-02 19:41:05] [INFO ] Flow matrix only has 1452 transitions (discarded 24 similar events)
// Phase 1: matrix 1452 rows 310 cols
[2025-06-02 19:41:05] [INFO ] Computed 44 invariants in 36 ms
[2025-06-02 19:41:05] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 1470 unsolved
[2025-06-02 19:41:30] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2025-06-02 19:41:30] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2025-06-02 19:41:34] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1470 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/1762 variables, and 36 constraints, problems are : Problem set: 0 solved, 1470 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/310 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1470/1470 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 1470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1470 unsolved
[2025-06-02 19:41:44] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 2 ms to minimize.
[2025-06-02 19:41:44] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1470 unsolved
[2025-06-02 19:41:55] [INFO ] Deduced a trap composed of 21 places in 267 ms of which 2 ms to minimize.
[2025-06-02 19:41:55] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
[2025-06-02 19:41:55] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/1762 variables, and 41 constraints, problems are : Problem set: 0 solved, 1470 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/310 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1470 constraints, Known Traps: 8/8 constraints]
After SMT, in 57246ms problems are : Problem set: 0 solved, 1470 unsolved
Search for dead transitions found 0 dead transitions in 57302ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57668 ms. Remains : 310/454 places, 1476/1614 transitions.
[2025-06-02 19:42:02] [INFO ] Flow matrix only has 1452 transitions (discarded 24 similar events)
[2025-06-02 19:42:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1] Max Struct:[1695, 1695]
RANDOM walk for 1000000 steps (10821 resets) in 9231 ms. (108 steps per ms)
BEST_FIRST walk for 2000001 steps (6481 resets) in 6001 ms. (333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1] Max Struct:[1695, 1695]
[2025-06-02 19:42:17] [INFO ] Flow matrix only has 1452 transitions (discarded 24 similar events)
[2025-06-02 19:42:17] [INFO ] Invariant cache hit.
[2025-06-02 19:42:17] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2025-06-02 19:42:17] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 18 ms returned sat
[2025-06-02 19:42:18] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2025-06-02 19:42:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:42:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-06-02 19:42:18] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 12 ms returned sat
[2025-06-02 19:42:19] [INFO ] [Nat]Absence check using state equation in 1090 ms returned sat
[2025-06-02 19:42:19] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:42:19] [INFO ] [Nat]Added 112 Read/Feed constraints in 424 ms returned sat
[2025-06-02 19:42:20] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2025-06-02 19:42:20] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:42:20] [INFO ] Deduced a trap composed of 11 places in 371 ms of which 2 ms to minimize.
[2025-06-02 19:42:21] [INFO ] Deduced a trap composed of 138 places in 374 ms of which 2 ms to minimize.
[2025-06-02 19:42:21] [INFO ] Deduced a trap composed of 134 places in 369 ms of which 2 ms to minimize.
[2025-06-02 19:42:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2009 ms
[2025-06-02 19:42:22] [INFO ] Computed and/alt/rep : 1144/4556/1139 causal constraints (skipped 307 transitions) in 126 ms.
[2025-06-02 19:42:26] [INFO ] Added : 107 causal constraints over 22 iterations in 4316 ms. Result :sat
Minimization took 4747 ms.
[2025-06-02 19:42:31] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-06-02 19:42:31] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 13 ms returned sat
[2025-06-02 19:42:32] [INFO ] [Real]Absence check using state equation in 996 ms returned sat
[2025-06-02 19:42:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:42:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-06-02 19:42:32] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 13 ms returned sat
[2025-06-02 19:42:34] [INFO ] [Nat]Absence check using state equation in 2048 ms returned sat
[2025-06-02 19:42:34] [INFO ] [Nat]Added 112 Read/Feed constraints in 479 ms returned sat
[2025-06-02 19:42:34] [INFO ] Computed and/alt/rep : 1144/4556/1139 causal constraints (skipped 307 transitions) in 178 ms.
[2025-06-02 19:42:35] [INFO ] Added : 15 causal constraints over 3 iterations in 632 ms. Result :sat
Minimization took 4835 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1] Max Struct:[1695, 1695]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[1695, 1695]
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1476/1476 transitions.
Applied a total of 0 rules in 44 ms. Remains 310 /310 variables (removed 0) and now considering 1476/1476 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 310/310 places, 1476/1476 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1476/1476 transitions.
Applied a total of 0 rules in 35 ms. Remains 310 /310 variables (removed 0) and now considering 1476/1476 (removed 0) transitions.
[2025-06-02 19:42:40] [INFO ] Flow matrix only has 1452 transitions (discarded 24 similar events)
[2025-06-02 19:42:40] [INFO ] Invariant cache hit.
[2025-06-02 19:42:40] [INFO ] Implicit Places using invariants in 505 ms returned [29, 203, 242, 282]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 514 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/310 places, 1476/1476 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 303 transition count 1473
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 303 transition count 1473
Applied a total of 6 rules in 52 ms. Remains 303 /306 variables (removed 3) and now considering 1473/1476 (removed 3) transitions.
[2025-06-02 19:42:40] [INFO ] Flow matrix only has 1449 transitions (discarded 24 similar events)
// Phase 1: matrix 1449 rows 303 cols
[2025-06-02 19:42:40] [INFO ] Computed 40 invariants in 23 ms
[2025-06-02 19:42:41] [INFO ] Implicit Places using invariants in 464 ms returned []
[2025-06-02 19:42:41] [INFO ] Flow matrix only has 1449 transitions (discarded 24 similar events)
[2025-06-02 19:42:41] [INFO ] Invariant cache hit.
[2025-06-02 19:42:42] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:42:47] [INFO ] Implicit Places using invariants and state equation in 6126 ms returned []
Implicit Place search using SMT with State Equation took 6601 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 303/310 places, 1473/1476 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7202 ms. Remains : 303/310 places, 1473/1476 transitions.
[2025-06-02 19:42:47] [INFO ] Flow matrix only has 1449 transitions (discarded 24 similar events)
[2025-06-02 19:42:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1] Max Struct:[46, 46]
RANDOM walk for 1000000 steps (10676 resets) in 8763 ms. (114 steps per ms)
BEST_FIRST walk for 2000002 steps (6392 resets) in 5949 ms. (336 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1] Max Struct:[46, 46]
[2025-06-02 19:43:02] [INFO ] Flow matrix only has 1449 transitions (discarded 24 similar events)
[2025-06-02 19:43:02] [INFO ] Invariant cache hit.
[2025-06-02 19:43:02] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2025-06-02 19:43:02] [INFO ] [Real]Absence check using 22 positive and 18 generalized place invariants in 7 ms returned sat
[2025-06-02 19:43:03] [INFO ] [Real]Absence check using state equation in 1033 ms returned sat
[2025-06-02 19:43:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:43:03] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2025-06-02 19:43:03] [INFO ] [Nat]Absence check using 22 positive and 18 generalized place invariants in 7 ms returned sat
[2025-06-02 19:43:08] [INFO ] [Nat]Absence check using state equation in 4756 ms returned sat
[2025-06-02 19:43:08] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:43:09] [INFO ] [Nat]Added 112 Read/Feed constraints in 1400 ms returned sat
[2025-06-02 19:43:09] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2025-06-02 19:43:09] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:43:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 425 ms
[2025-06-02 19:43:10] [INFO ] Computed and/alt/rep : 1141/4552/1136 causal constraints (skipped 307 transitions) in 81 ms.
[2025-06-02 19:43:14] [INFO ] Added : 197 causal constraints over 40 iterations in 4074 ms. Result :sat
Minimization took 4874 ms.
[2025-06-02 19:43:18] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2025-06-02 19:43:18] [INFO ] [Real]Absence check using 22 positive and 18 generalized place invariants in 6 ms returned sat
[2025-06-02 19:43:20] [INFO ] [Real]Absence check using state equation in 1120 ms returned sat
[2025-06-02 19:43:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:43:20] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2025-06-02 19:43:20] [INFO ] [Nat]Absence check using 22 positive and 18 generalized place invariants in 7 ms returned sat
[2025-06-02 19:43:21] [INFO ] [Nat]Absence check using state equation in 1337 ms returned sat
[2025-06-02 19:43:22] [INFO ] [Nat]Added 112 Read/Feed constraints in 495 ms returned sat
[2025-06-02 19:43:22] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 0 ms to minimize.
[2025-06-02 19:43:22] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2025-06-02 19:43:22] [INFO ] Deduced a trap composed of 11 places in 342 ms of which 2 ms to minimize.
[2025-06-02 19:43:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 963 ms
[2025-06-02 19:43:23] [INFO ] Computed and/alt/rep : 1141/4552/1136 causal constraints (skipped 307 transitions) in 86 ms.
[2025-06-02 19:43:26] [INFO ] Added : 117 causal constraints over 24 iterations in 3137 ms. Result :sat
Minimization took 4876 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1] Max Struct:[46, 46]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[46, 46]
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1473/1473 transitions.
Applied a total of 0 rules in 44 ms. Remains 303 /303 variables (removed 0) and now considering 1473/1473 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 303/303 places, 1473/1473 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1473/1473 transitions.
Applied a total of 0 rules in 28 ms. Remains 303 /303 variables (removed 0) and now considering 1473/1473 (removed 0) transitions.
[2025-06-02 19:43:31] [INFO ] Flow matrix only has 1449 transitions (discarded 24 similar events)
[2025-06-02 19:43:31] [INFO ] Invariant cache hit.
[2025-06-02 19:43:31] [INFO ] Implicit Places using invariants in 451 ms returned []
[2025-06-02 19:43:31] [INFO ] Flow matrix only has 1449 transitions (discarded 24 similar events)
[2025-06-02 19:43:31] [INFO ] Invariant cache hit.
[2025-06-02 19:43:32] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:43:37] [INFO ] Implicit Places using invariants and state equation in 6343 ms returned []
Implicit Place search using SMT with State Equation took 6813 ms to find 0 implicit places.
[2025-06-02 19:43:38] [INFO ] Redundant transitions in 85 ms returned []
Running 1467 sub problems to find dead transitions.
[2025-06-02 19:43:38] [INFO ] Flow matrix only has 1449 transitions (discarded 24 similar events)
[2025-06-02 19:43:38] [INFO ] Invariant cache hit.
[2025-06-02 19:43:38] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
[2025-06-02 19:44:01] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 1 ms to minimize.
[2025-06-02 19:44:02] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 1 ms to minimize.
[2025-06-02 19:44:02] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 2 ms to minimize.
[2025-06-02 19:44:02] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 2 ms to minimize.
[2025-06-02 19:44:03] [INFO ] Deduced a trap composed of 100 places in 192 ms of which 1 ms to minimize.
[2025-06-02 19:44:04] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2025-06-02 19:44:06] [INFO ] Deduced a trap composed of 92 places in 169 ms of which 2 ms to minimize.
[2025-06-02 19:44:06] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 1 ms to minimize.
[2025-06-02 19:44:06] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 2 ms to minimize.
[2025-06-02 19:44:07] [INFO ] Deduced a trap composed of 87 places in 243 ms of which 2 ms to minimize.
[2025-06-02 19:44:08] [INFO ] Deduced a trap composed of 77 places in 198 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
[2025-06-02 19:44:19] [INFO ] Deduced a trap composed of 90 places in 162 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/1752 variables, and 45 constraints, problems are : Problem set: 0 solved, 1467 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 15/18 constraints, State Equation: 0/303 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1467/1467 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1467 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
[2025-06-02 19:44:26] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 0 ms to minimize.
[2025-06-02 19:44:26] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:44:35] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
[2025-06-02 19:44:41] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/1752 variables, and 49 constraints, problems are : Problem set: 0 solved, 1467 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 15/18 constraints, State Equation: 0/303 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1467 constraints, Known Traps: 16/16 constraints]
After SMT, in 75932ms problems are : Problem set: 0 solved, 1467 unsolved
Search for dead transitions found 0 dead transitions in 75947ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82891 ms. Remains : 303/303 places, 1473/1473 transitions.
RANDOM walk for 40001 steps (425 resets) in 1353 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (119 resets) in 437 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (112 resets) in 356 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (128 resets) in 367 ms. (108 steps per ms) remains 4/4 properties
[2025-06-02 19:44:54] [INFO ] Flatten gal took : 353 ms
BEST_FIRST walk for 40003 steps (123 resets) in 323 ms. (123 steps per ms) remains 4/4 properties
[2025-06-02 19:44:54] [INFO ] Flatten gal took : 181 ms
[2025-06-02 19:44:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16356091111975456053.gal : 126 ms
[2025-06-02 19:44:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17645346181151011583.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16356091111975456053.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17645346181151011583.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17645346181151011583.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :9 after 12
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :13 after 15
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :15 after 17
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :17 after 34
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :34 after 243
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :243 after 343
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :343 after 911
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :911 after 7325
Interrupted probabilistic random walk after 153236 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 4
Probabilistic random walk after 153236 steps, saw 74546 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :0
[2025-06-02 19:44:57] [INFO ] Flow matrix only has 1449 transitions (discarded 24 similar events)
[2025-06-02 19:44:57] [INFO ] Invariant cache hit.
[2025-06-02 19:44:57] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 122/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 91/215 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/237 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/242 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD size :7325 after 16291
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 58/300 variables, 17/38 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/301 variables, 1/39 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1449/1750 variables, 301/340 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1750 variables, 112/452 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1750 variables, 0/452 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1752 variables, 2/454 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1752 variables, 1/455 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1752 variables, 0/455 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1752 variables, 0/455 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1752/1752 variables, and 455 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1238 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 303/303 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/124 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 91/215 variables, 17/18 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/237 variables, 2/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/242 variables, 1/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 58/300 variables, 17/38 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2025-06-02 19:44:59] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2025-06-02 19:44:59] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:44:59] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 3/41 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/301 variables, 1/42 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :16291 after 151976
At refinement iteration 14 (OVERLAPS) 1449/1750 variables, 301/343 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1750 variables, 112/455 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem MIN0 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1750/1752 variables, and 457 constraints, problems are : Problem set: 3 solved, 1 unsolved in 2529 ms.
Refiners :[Positive P Invariants (semi-flows): 21/22 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 301/303 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 3790ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1473/1473 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 301 transition count 1471
Applied a total of 4 rules in 37 ms. Remains 301 /303 variables (removed 2) and now considering 1471/1473 (removed 2) transitions.
Running 1465 sub problems to find dead transitions.
[2025-06-02 19:45:01] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
// Phase 1: matrix 1447 rows 301 cols
[2025-06-02 19:45:01] [INFO ] Computed 40 invariants in 23 ms
[2025-06-02 19:45:01] [INFO ] State equation strengthened by 112 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :151976 after 983805
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :983805 after 4.93258e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:45:28] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 2 ms to minimize.
[2025-06-02 19:45:28] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 1 ms to minimize.
[2025-06-02 19:45:29] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2025-06-02 19:45:32] [INFO ] Deduced a trap composed of 83 places in 263 ms of which 1 ms to minimize.
[2025-06-02 19:45:32] [INFO ] Deduced a trap composed of 86 places in 242 ms of which 1 ms to minimize.
[2025-06-02 19:45:33] [INFO ] Deduced a trap composed of 78 places in 236 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/1748 variables, and 39 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1465/1465 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:45:42] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 19:45:45] [INFO ] Flatten gal took : 96 ms
[2025-06-02 19:45:45] [INFO ] Applying decomposition
[2025-06-02 19:45:45] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5012017078446600018.txt' '-o' '/tmp/graph5012017078446600018.bin' '-w' '/tmp/graph5012017078446600018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5012017078446600018.bin' '-l' '-1' '-v' '-w' '/tmp/graph5012017078446600018.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:45:45] [INFO ] Decomposing Gal with order
[2025-06-02 19:45:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:45:46] [INFO ] Removed a total of 598 redundant transitions.
[2025-06-02 19:45:46] [INFO ] Flatten gal took : 277 ms
[2025-06-02 19:45:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 403 labels/synchronizations in 41 ms.
[2025-06-02 19:45:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5117130822191355858.gal : 123 ms
[2025-06-02 19:45:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality639670817056040343.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5117130822191355858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality639670817056040343.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality639670817056040343.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 101
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :101 after 109
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :109 after 111
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :111 after 115
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :115 after 125
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :125 after 132
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :132 after 145
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :145 after 7252
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7252 after 8423
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8423 after 40254
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :40254 after 67176
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :67176 after 1.40621e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:45:57] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2025-06-02 19:45:57] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:45:57] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/1748 variables, and 43 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1465 constraints, Known Traps: 10/10 constraints]
After SMT, in 58513ms problems are : Problem set: 0 solved, 1465 unsolved
Search for dead transitions found 0 dead transitions in 58532ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58577 ms. Remains : 301/303 places, 1471/1473 transitions.
RANDOM walk for 40000 steps (434 resets) in 619 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (152 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 245784 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 245784 steps, saw 122735 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2025-06-02 19:46:03] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:46:03] [INFO ] Invariant cache hit.
[2025-06-02 19:46:03] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 176/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 54/231 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/236 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/298 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/299 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1447/1746 variables, 299/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1746 variables, 112/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1746 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1748 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1748 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1748 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1748 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1748/1748 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 301/301 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 176/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/231 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/236 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/298 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:46:04] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 8 ms to minimize.
[2025-06-02 19:46:04] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:46:04] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/299 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1447/1746 variables, 299/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1746 variables, 112/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1746 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1746 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1748 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1748 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1748 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1748 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1748/1748 variables, and 457 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2370 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 301/301 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 3466ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 1471/1471 transitions.
Applied a total of 0 rules in 28 ms. Remains 301 /301 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 301/301 places, 1471/1471 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 1471/1471 transitions.
Applied a total of 0 rules in 25 ms. Remains 301 /301 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
[2025-06-02 19:46:07] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:46:07] [INFO ] Invariant cache hit.
[2025-06-02 19:46:07] [INFO ] Implicit Places using invariants in 458 ms returned []
[2025-06-02 19:46:07] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:46:07] [INFO ] Invariant cache hit.
[2025-06-02 19:46:08] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:46:13] [INFO ] Implicit Places using invariants and state equation in 5984 ms returned []
Implicit Place search using SMT with State Equation took 6445 ms to find 0 implicit places.
[2025-06-02 19:46:13] [INFO ] Redundant transitions in 85 ms returned []
Running 1465 sub problems to find dead transitions.
[2025-06-02 19:46:13] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:46:13] [INFO ] Invariant cache hit.
[2025-06-02 19:46:13] [INFO ] State equation strengthened by 112 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:46:40] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 2 ms to minimize.
[2025-06-02 19:46:40] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 1 ms to minimize.
[2025-06-02 19:46:41] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 2 ms to minimize.
[2025-06-02 19:46:45] [INFO ] Deduced a trap composed of 86 places in 241 ms of which 2 ms to minimize.
[2025-06-02 19:46:45] [INFO ] Deduced a trap composed of 78 places in 208 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/1748 variables, and 38 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1465/1465 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:47:04] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:47:04] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2025-06-02 19:47:04] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:47:19] [INFO ] Deduced a trap composed of 90 places in 201 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/1748 variables, and 42 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1465 constraints, Known Traps: 9/9 constraints]
After SMT, in 78589ms problems are : Problem set: 0 solved, 1465 unsolved
Search for dead transitions found 0 dead transitions in 78606ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85170 ms. Remains : 301/301 places, 1471/1471 transitions.
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-08 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[1] Max Struct:[46]
Starting property specific reduction for PolyORBLF-PT-S06J04T04-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[46]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[46]
[2025-06-02 19:47:32] [INFO ] Flow matrix only has 1449 transitions (discarded 24 similar events)
// Phase 1: matrix 1449 rows 303 cols
[2025-06-02 19:47:32] [INFO ] Computed 40 invariants in 32 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[46]
RANDOM walk for 10000 steps (106 resets) in 92 ms. (107 steps per ms)
BEST_FIRST walk for 10000 steps (50 resets) in 33 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[46]
[2025-06-02 19:47:32] [INFO ] Flow matrix only has 1449 transitions (discarded 24 similar events)
[2025-06-02 19:47:32] [INFO ] Invariant cache hit.
[2025-06-02 19:47:32] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2025-06-02 19:47:32] [INFO ] [Real]Absence check using 22 positive and 18 generalized place invariants in 7 ms returned sat
[2025-06-02 19:47:33] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2025-06-02 19:47:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:47:33] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2025-06-02 19:47:33] [INFO ] [Nat]Absence check using 22 positive and 18 generalized place invariants in 6 ms returned sat
[2025-06-02 19:47:35] [INFO ] [Nat]Absence check using state equation in 1323 ms returned sat
[2025-06-02 19:47:35] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:47:35] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:47:35] [INFO ] [Nat]Added 112 Read/Feed constraints in 612 ms returned sat
[2025-06-02 19:47:35] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2025-06-02 19:47:36] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2025-06-02 19:47:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 439 ms
[2025-06-02 19:47:36] [INFO ] Computed and/alt/rep : 1141/4552/1136 causal constraints (skipped 307 transitions) in 87 ms.
[2025-06-02 19:47:37] [INFO ] Added : 68 causal constraints over 14 iterations in 1552 ms. Result :sat
Minimization took 640 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[46]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[46]
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1473/1473 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 301 transition count 1471
Applied a total of 4 rules in 54 ms. Remains 301 /303 variables (removed 2) and now considering 1471/1473 (removed 2) transitions.
Running 1465 sub problems to find dead transitions.
[2025-06-02 19:47:38] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
// Phase 1: matrix 1447 rows 301 cols
[2025-06-02 19:47:38] [INFO ] Computed 40 invariants in 26 ms
[2025-06-02 19:47:38] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:48:04] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 1 ms to minimize.
[2025-06-02 19:48:04] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 2 ms to minimize.
[2025-06-02 19:48:05] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2025-06-02 19:48:08] [INFO ] Deduced a trap composed of 83 places in 272 ms of which 2 ms to minimize.
[2025-06-02 19:48:09] [INFO ] Deduced a trap composed of 86 places in 242 ms of which 2 ms to minimize.
[2025-06-02 19:48:09] [INFO ] Deduced a trap composed of 78 places in 200 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/1748 variables, and 39 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1465/1465 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:48:18] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:48:32] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:48:32] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2025-06-02 19:48:33] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/1748 variables, and 43 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1465 constraints, Known Traps: 10/10 constraints]
After SMT, in 57738ms problems are : Problem set: 0 solved, 1465 unsolved
Search for dead transitions found 0 dead transitions in 57753ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57813 ms. Remains : 301/303 places, 1471/1473 transitions.
[2025-06-02 19:48:36] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:48:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[46]
RANDOM walk for 1000000 steps (10832 resets) in 8938 ms. (111 steps per ms)
BEST_FIRST walk for 1000001 steps (3695 resets) in 3233 ms. (309 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[46]
[2025-06-02 19:48:48] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:48:48] [INFO ] Invariant cache hit.
[2025-06-02 19:48:48] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-06-02 19:48:48] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 8 ms returned sat
[2025-06-02 19:48:49] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2025-06-02 19:48:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:48:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-06-02 19:48:49] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 8 ms returned sat
[2025-06-02 19:48:53] [INFO ] [Nat]Absence check using state equation in 4635 ms returned sat
[2025-06-02 19:48:53] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:48:55] [INFO ] [Nat]Added 112 Read/Feed constraints in 1244 ms returned sat
[2025-06-02 19:48:55] [INFO ] Computed and/alt/rep : 1139/4550/1134 causal constraints (skipped 307 transitions) in 82 ms.
[2025-06-02 19:48:56] [INFO ] Added : 20 causal constraints over 4 iterations in 806 ms. Result :sat
Minimization took 4717 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[46]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[46]
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 1471/1471 transitions.
Applied a total of 0 rules in 25 ms. Remains 301 /301 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 301/301 places, 1471/1471 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 1471/1471 transitions.
Applied a total of 0 rules in 24 ms. Remains 301 /301 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
[2025-06-02 19:49:00] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:49:00] [INFO ] Invariant cache hit.
[2025-06-02 19:49:01] [INFO ] Implicit Places using invariants in 444 ms returned []
[2025-06-02 19:49:01] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:49:01] [INFO ] Invariant cache hit.
[2025-06-02 19:49:01] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:49:06] [INFO ] Implicit Places using invariants and state equation in 5694 ms returned []
Implicit Place search using SMT with State Equation took 6146 ms to find 0 implicit places.
[2025-06-02 19:49:07] [INFO ] Redundant transitions in 44 ms returned []
Running 1465 sub problems to find dead transitions.
[2025-06-02 19:49:07] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:49:07] [INFO ] Invariant cache hit.
[2025-06-02 19:49:07] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:49:31] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 1 ms to minimize.
[2025-06-02 19:49:32] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 1 ms to minimize.
[2025-06-02 19:49:32] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 2 ms to minimize.
[2025-06-02 19:49:36] [INFO ] Deduced a trap composed of 86 places in 258 ms of which 2 ms to minimize.
[2025-06-02 19:49:36] [INFO ] Deduced a trap composed of 78 places in 226 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 2.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 3.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 2.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 2.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 6.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 2.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 9.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/1748 variables, and 38 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1465/1465 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:49:56] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2025-06-02 19:49:56] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 0 ms to minimize.
[2025-06-02 19:49:56] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:50:10] [INFO ] Deduced a trap composed of 90 places in 221 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/1748 variables, and 42 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1465 constraints, Known Traps: 9/9 constraints]
After SMT, in 76768ms problems are : Problem set: 0 solved, 1465 unsolved
Search for dead transitions found 0 dead transitions in 76783ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83008 ms. Remains : 301/301 places, 1471/1471 transitions.
[2025-06-02 19:50:23] [INFO ] Flatten gal took : 105 ms
[2025-06-02 19:50:24] [INFO ] Flatten gal took : 78 ms
RANDOM walk for 40000 steps (448 resets) in 647 ms. (61 steps per ms) remains 2/2 properties
[2025-06-02 19:50:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11357592663522961256.gal : 16 ms
[2025-06-02 19:50:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18083384761421808650.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11357592663522961256.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18083384761421808650.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40002 steps (138 resets) in 270 ms. (147 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (172 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality18083384761421808650.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 15
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :15 after 17
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :17 after 24
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :24 after 88
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :88 after 282
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :282 after 421
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :421 after 6076
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6076 after 9715
Interrupted probabilistic random walk after 193477 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 193477 steps, saw 102644 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2025-06-02 19:50:27] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:50:27] [INFO ] Invariant cache hit.
[2025-06-02 19:50:27] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 176/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/231 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:50:27] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/236 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 8 (OVERLAPS) 62/298 variables, 19/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:50:27] [INFO ] Deduced a trap composed of 50 places in 237 ms of which 2 ms to minimize.
[2025-06-02 19:50:27] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2025-06-02 19:50:27] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 3/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/299 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1746/1748 variables, and 342 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 299/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 176/177 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/231 variables, 14/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/236 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/298 variables, 19/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 3/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:50:29] [INFO ] Deduced a trap composed of 136 places in 327 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/299 variables, 1/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :9715 after 133386
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1746/1748 variables, and 343 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2143 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 299/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 3569ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 1471/1471 transitions.
Applied a total of 0 rules in 29 ms. Remains 301 /301 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
Running 1465 sub problems to find dead transitions.
[2025-06-02 19:50:30] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:50:30] [INFO ] Invariant cache hit.
[2025-06-02 19:50:30] [INFO ] State equation strengthened by 112 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :133386 after 1.01229e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.01229e+06 after 5.06884e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:50:57] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 1 ms to minimize.
[2025-06-02 19:50:57] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 2 ms to minimize.
[2025-06-02 19:50:58] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 1 ms to minimize.
[2025-06-02 19:51:02] [INFO ] Deduced a trap composed of 86 places in 221 ms of which 1 ms to minimize.
[2025-06-02 19:51:02] [INFO ] Deduced a trap composed of 78 places in 194 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/1748 variables, and 38 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1465/1465 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:51:12] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2025-06-02 19:51:12] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 0 ms to minimize.
[2025-06-02 19:51:12] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 0 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 19:51:14] [INFO ] Flatten gal took : 68 ms
[2025-06-02 19:51:14] [INFO ] Applying decomposition
[2025-06-02 19:51:14] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5171992637034363478.txt' '-o' '/tmp/graph5171992637034363478.bin' '-w' '/tmp/graph5171992637034363478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5171992637034363478.bin' '-l' '-1' '-v' '-w' '/tmp/graph5171992637034363478.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:51:14] [INFO ] Decomposing Gal with order
[2025-06-02 19:51:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:51:14] [INFO ] Removed a total of 655 redundant transitions.
[2025-06-02 19:51:14] [INFO ] Flatten gal took : 191 ms
[2025-06-02 19:51:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 341 labels/synchronizations in 35 ms.
[2025-06-02 19:51:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13774342232039530777.gal : 18 ms
[2025-06-02 19:51:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13109330934938890825.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13774342232039530777.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13109330934938890825.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13109330934938890825.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 88
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :88 after 1382
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1382 after 1432
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1432 after 1432
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1432 after 3772
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3772 after 3772
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3772 after 86602
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :86602 after 86602
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:51:27] [INFO ] Deduced a trap composed of 90 places in 198 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/1748 variables, and 42 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1465 constraints, Known Traps: 9/9 constraints]
After SMT, in 58782ms problems are : Problem set: 0 solved, 1465 unsolved
Search for dead transitions found 0 dead transitions in 58795ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58828 ms. Remains : 301/301 places, 1471/1471 transitions.
RANDOM walk for 40001 steps (442 resets) in 533 ms. (74 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (140 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 243709 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 243709 steps, saw 121394 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2025-06-02 19:51:32] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:51:32] [INFO ] Invariant cache hit.
[2025-06-02 19:51:32] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 176/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 54/231 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/236 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/298 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/299 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1447/1746 variables, 299/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1746 variables, 112/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1746 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1748 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1748 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1748 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1748 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1748/1748 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 301/301 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 176/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/231 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/236 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/298 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:51:34] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2025-06-02 19:51:34] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 0 ms to minimize.
[2025-06-02 19:51:34] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/299 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1447/1746 variables, 299/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1746 variables, 112/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1746 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1746 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1748 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1748 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1748 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1748 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1748/1748 variables, and 457 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2300 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 301/301 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 3319ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 1471/1471 transitions.
Applied a total of 0 rules in 23 ms. Remains 301 /301 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 301/301 places, 1471/1471 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 1471/1471 transitions.
Applied a total of 0 rules in 24 ms. Remains 301 /301 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
[2025-06-02 19:51:36] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:51:36] [INFO ] Invariant cache hit.
[2025-06-02 19:51:36] [INFO ] Implicit Places using invariants in 437 ms returned []
[2025-06-02 19:51:36] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:51:36] [INFO ] Invariant cache hit.
[2025-06-02 19:51:37] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:51:42] [INFO ] Implicit Places using invariants and state equation in 5828 ms returned []
Implicit Place search using SMT with State Equation took 6269 ms to find 0 implicit places.
[2025-06-02 19:51:42] [INFO ] Redundant transitions in 36 ms returned []
Running 1465 sub problems to find dead transitions.
[2025-06-02 19:51:42] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2025-06-02 19:51:42] [INFO ] Invariant cache hit.
[2025-06-02 19:51:42] [INFO ] State equation strengthened by 112 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :691163 after 691433
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:52:10] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 1 ms to minimize.
[2025-06-02 19:52:10] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 2 ms to minimize.
[2025-06-02 19:52:11] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 1 ms to minimize.
[2025-06-02 19:52:15] [INFO ] Deduced a trap composed of 86 places in 249 ms of which 1 ms to minimize.
[2025-06-02 19:52:15] [INFO ] Deduced a trap composed of 78 places in 222 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/1748 variables, and 38 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1465/1465 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:52:34] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2025-06-02 19:52:34] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2025-06-02 19:52:34] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2025-06-02 19:52:49] [INFO ] Deduced a trap composed of 90 places in 225 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/1748 variables, and 42 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1465 constraints, Known Traps: 9/9 constraints]
After SMT, in 79849ms problems are : Problem set: 0 solved, 1465 unsolved
Search for dead transitions found 0 dead transitions in 79861ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86200 ms. Remains : 301/301 places, 1471/1471 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[46]
Ending property specific reduction for PolyORBLF-PT-S06J04T04-UpperBounds-11 in 330139 ms.
[2025-06-02 19:53:02] [INFO ] Flatten gal took : 70 ms
[2025-06-02 19:53:02] [INFO ] Applying decomposition
[2025-06-02 19:53:02] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16641145695344767519.txt' '-o' '/tmp/graph16641145695344767519.bin' '-w' '/tmp/graph16641145695344767519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16641145695344767519.bin' '-l' '-1' '-v' '-w' '/tmp/graph16641145695344767519.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:53:02] [INFO ] Decomposing Gal with order
[2025-06-02 19:53:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:53:02] [INFO ] Removed a total of 596 redundant transitions.
[2025-06-02 19:53:03] [INFO ] Flatten gal took : 119 ms
[2025-06-02 19:53:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 348 labels/synchronizations in 20 ms.
[2025-06-02 19:53:03] [INFO ] Time to serialize gal into /tmp/UpperBounds6811795283780102176.gal : 15 ms
[2025-06-02 19:53:03] [INFO ] Time to serialize properties into /tmp/UpperBounds15427133612119672656.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6811795283780102176.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15427133612119672656.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds15427133612119672656.prop.
ITS-tools command line returned an error code 137
[2025-06-02 19:59:52] [INFO ] Flatten gal took : 66 ms
[2025-06-02 19:59:52] [INFO ] Time to serialize gal into /tmp/UpperBounds8544677243353899791.gal : 18 ms
[2025-06-02 19:59:52] [INFO ] Time to serialize properties into /tmp/UpperBounds16240698686147242719.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8544677243353899791.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16240698686147242719.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds16240698686147242719.prop.
ITS-tools command line returned an error code 137
[2025-06-02 20:05:27] [INFO ] Flatten gal took : 67 ms
[2025-06-02 20:05:27] [INFO ] Input system was already deterministic with 1473 transitions.
[2025-06-02 20:05:27] [INFO ] Transformed 303 places.
[2025-06-02 20:05:27] [INFO ] Transformed 1473 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 20:05:58] [INFO ] Time to serialize gal into /tmp/UpperBounds3198901739906032966.gal : 20 ms
[2025-06-02 20:05:58] [INFO ] Time to serialize properties into /tmp/UpperBounds16656978209055051992.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3198901739906032966.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16656978209055051992.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16656978209055051992.prop.
ITS-tools command line returned an error code 137
Total runtime 1882199 ms.

BK_STOP 1748895134757

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S06J04T04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-PT-S06J04T04, 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 r167-tall-174881266100064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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