MCC'2023- Execution of r297-tall-167873950800700

About the Execution of LTSMin+red for PolyORBNT-COL-S10J60

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2319.392	565220.00	620109.00	1750.80	FFFF??TFTFTFFT?F	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 00:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679615407280

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J60
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 23:50:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 23:50:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 23:50:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-23 23:50:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 23:50:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 771 ms
[2023-03-23 23:50:10] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-23 23:50:10] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2023-03-23 23:50:10] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10006 steps, including 566 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 190 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 203 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 23:50:10] [INFO ] Computed 13 place invariants in 12 ms
[2023-03-23 23:50:11] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2023-03-23 23:50:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-23 23:50:11] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-23 23:50:11] [INFO ] Flatten gal took : 31 ms
[2023-03-23 23:50:11] [INFO ] Flatten gal took : 10 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-23 23:50:11] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 232 ms.
[2023-03-23 23:50:11] [INFO ] Unfolded 14 HLPN properties in 5 ms.
Initial state reduction rules removed 1 formulas.
[2023-03-23 23:50:11] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-23 23:50:11] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-23 23:50:11] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-23 23:50:11] [INFO ] Reduced 780 identical enabling conditions.
Deduced a syphon composed of 60 places in 29 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 468 out of 1234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1223 transition count 2809
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1223 transition count 2809
Applied a total of 12 rules in 216 ms. Remains 1223 /1234 variables (removed 11) and now considering 2809/2810 (removed 1) transitions.
[2023-03-23 23:50:11] [INFO ] Flow matrix only has 2800 transitions (discarded 9 similar events)
// Phase 1: matrix 2800 rows 1223 cols
[2023-03-23 23:50:12] [INFO ] Computed 142 place invariants in 204 ms
[2023-03-23 23:50:14] [INFO ] Dead Transitions using invariants and state equation in 2566 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-23 23:50:14] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-23 23:50:14] [INFO ] Computed 142 place invariants in 138 ms
[2023-03-23 23:50:15] [INFO ] Implicit Places using invariants in 934 ms returned []
[2023-03-23 23:50:15] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:50:15] [INFO ] Invariant cache hit.
[2023-03-23 23:50:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:50:19] [INFO ] Implicit Places using invariants and state equation in 4253 ms returned []
Implicit Place search using SMT with State Equation took 5189 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1223/1234 places, 2194/2810 transitions.
Applied a total of 0 rules in 29 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8016 ms. Remains : 1223/1234 places, 2194/2810 transitions.
Support contains 468 out of 1223 places after structural reductions.
[2023-03-23 23:50:20] [INFO ] Flatten gal took : 270 ms
[2023-03-23 23:50:20] [INFO ] Flatten gal took : 197 ms
[2023-03-23 23:50:20] [INFO ] Input system was already deterministic with 2194 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 1135 ms. (steps per millisecond=8 ) properties (out of 22) seen :5
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 17) seen :9
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-23 23:50:22] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:50:22] [INFO ] Invariant cache hit.
[2023-03-23 23:50:23] [INFO ] [Real]Absence check using 136 positive place invariants in 51 ms returned sat
[2023-03-23 23:50:23] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 31 ms returned sat
[2023-03-23 23:50:31] [INFO ] After 2404ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:5
[2023-03-23 23:50:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:50:33] [INFO ] After 1537ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :1 sat :1 real:5
[2023-03-23 23:50:34] [INFO ] After 3222ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 1490 ms.
[2023-03-23 23:50:36] [INFO ] After 13056ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:5
[2023-03-23 23:50:36] [INFO ] [Nat]Absence check using 136 positive place invariants in 46 ms returned sat
[2023-03-23 23:50:36] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 31 ms returned sat
[2023-03-23 23:50:46] [INFO ] After 9734ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-23 23:50:53] [INFO ] After 6676ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-23 23:50:58] [INFO ] After 11984ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 23:51:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 23:51:01] [INFO ] After 25096ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1 real:5
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 141 out of 1223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1223 transition count 2130
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 1159 transition count 2130
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 128 place count 1159 transition count 2067
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 254 place count 1096 transition count 2067
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 260 place count 1093 transition count 2064
Applied a total of 260 rules in 262 ms. Remains 1093 /1223 variables (removed 130) and now considering 2064/2194 (removed 130) transitions.
[2023-03-23 23:51:01] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-23 23:51:01] [INFO ] Computed 142 place invariants in 78 ms
[2023-03-23 23:51:03] [INFO ] Dead Transitions using invariants and state equation in 1624 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1900 ms. Remains : 1093/1223 places, 2064/2194 transitions.
Finished random walk after 467 steps, including 29 resets, run visited all 6 properties in 31 ms. (steps per millisecond=15 )
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(!p0))&&X((p1&&F(p2)))))'
Support contains 3 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 43 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-23 23:51:04] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-23 23:51:04] [INFO ] Computed 142 place invariants in 64 ms
[2023-03-23 23:51:06] [INFO ] Dead Transitions using invariants and state equation in 1898 ms found 0 transitions.
[2023-03-23 23:51:06] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:51:06] [INFO ] Invariant cache hit.
[2023-03-23 23:51:07] [INFO ] Implicit Places using invariants in 1256 ms returned []
[2023-03-23 23:51:07] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:51:07] [INFO ] Invariant cache hit.
[2023-03-23 23:51:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:51:13] [INFO ] Implicit Places using invariants and state equation in 6611 ms returned []
Implicit Place search using SMT with State Equation took 7873 ms to find 0 implicit places.
[2023-03-23 23:51:13] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:51:13] [INFO ] Invariant cache hit.
[2023-03-23 23:51:15] [INFO ] Dead Transitions using invariants and state equation in 1906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11730 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p2) (NOT p1) p0), p0, p0, (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s1222 1), p1:(GEQ s63 1), p2:(LT s381 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-00 finished in 12344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1223 transition count 2130
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 1159 transition count 2129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 1158 transition count 2129
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 1158 transition count 2065
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 1094 transition count 2065
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 264 place count 1091 transition count 2062
Applied a total of 264 rules in 209 ms. Remains 1091 /1223 variables (removed 132) and now considering 2062/2194 (removed 132) transitions.
[2023-03-23 23:51:16] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 23:51:16] [INFO ] Computed 142 place invariants in 53 ms
[2023-03-23 23:51:17] [INFO ] Dead Transitions using invariants and state equation in 1391 ms found 0 transitions.
[2023-03-23 23:51:17] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 23:51:17] [INFO ] Invariant cache hit.
[2023-03-23 23:51:18] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2023-03-23 23:51:18] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 23:51:18] [INFO ] Invariant cache hit.
[2023-03-23 23:51:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:51:27] [INFO ] Implicit Places using invariants and state equation in 8501 ms returned []
Implicit Place search using SMT with State Equation took 9504 ms to find 0 implicit places.
[2023-03-23 23:51:27] [INFO ] Redundant transitions in 118 ms returned []
[2023-03-23 23:51:27] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 23:51:27] [INFO ] Invariant cache hit.
[2023-03-23 23:51:28] [INFO ] Dead Transitions using invariants and state equation in 1340 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1091/1223 places, 2062/2194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12582 ms. Remains : 1091/1223 places, 2062/2194 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s314 1) (GEQ s1013 1)), p0:(OR (AND (GEQ s62 1) (GEQ s188 1) (GEQ s250 1)) (AND (GEQ s62 1) (GEQ s188 1) (GEQ s252 1)) (AND (GEQ s62 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-02 finished in 12691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 73 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 44 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-23 23:51:28] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-23 23:51:29] [INFO ] Computed 142 place invariants in 55 ms
[2023-03-23 23:51:30] [INFO ] Dead Transitions using invariants and state equation in 1931 ms found 0 transitions.
[2023-03-23 23:51:30] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:51:30] [INFO ] Invariant cache hit.
[2023-03-23 23:51:31] [INFO ] Implicit Places using invariants in 1073 ms returned []
[2023-03-23 23:51:31] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:51:31] [INFO ] Invariant cache hit.
[2023-03-23 23:51:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:51:39] [INFO ] Implicit Places using invariants and state equation in 7894 ms returned []
Implicit Place search using SMT with State Equation took 8981 ms to find 0 implicit places.
[2023-03-23 23:51:39] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:51:39] [INFO ] Invariant cache hit.
[2023-03-23 23:51:41] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12784 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s1159 1) (LT s1161 1) (LT s1163 1) (LT s1165 1) (LT s1167 1) (LT s1169 1) (LT s1171 1) (LT s1173 1) (LT s1208 1) (LT s1206 1) (LT s1212 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-03 finished in 12919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 13 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 37 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-23 23:51:41] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:51:41] [INFO ] Invariant cache hit.
[2023-03-23 23:51:43] [INFO ] Dead Transitions using invariants and state equation in 1867 ms found 0 transitions.
[2023-03-23 23:51:43] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:51:43] [INFO ] Invariant cache hit.
[2023-03-23 23:51:44] [INFO ] Implicit Places using invariants in 1120 ms returned []
[2023-03-23 23:51:44] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:51:44] [INFO ] Invariant cache hit.
[2023-03-23 23:51:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:51:54] [INFO ] Implicit Places using invariants and state equation in 9306 ms returned []
Implicit Place search using SMT with State Equation took 10449 ms to find 0 implicit places.
[2023-03-23 23:51:54] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:51:54] [INFO ] Invariant cache hit.
[2023-03-23 23:51:56] [INFO ] Dead Transitions using invariants and state equation in 1838 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14195 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s1094 1) (AND (GEQ s383 1) (GEQ s386 1) (GEQ s388 1) (GEQ s394 8)) (AND (GEQ s383 1) (GEQ s385 2) (GEQ s394 8)) (AND (GEQ s383 1) (GEQ s388 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9595 reset in 919 ms.
Product exploration explored 100000 steps with 9501 reset in 907 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 214 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-23 23:51:58] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:51:58] [INFO ] Invariant cache hit.
[2023-03-23 23:52:01] [INFO ] [Real]Absence check using 136 positive place invariants in 216 ms returned sat
[2023-03-23 23:52:01] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 174 ms returned sat
[2023-03-23 23:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:52:05] [INFO ] [Real]Absence check using state equation in 4425 ms returned sat
[2023-03-23 23:52:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:52:06] [INFO ] [Real]Added 1 Read/Feed constraints in 27 ms returned sat
[2023-03-23 23:52:06] [INFO ] Computed and/alt/rep : 1251/3347/1251 causal constraints (skipped 923 transitions) in 428 ms.
[2023-03-23 23:52:07] [INFO ] Added : 4 causal constraints over 1 iterations in 906 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 13 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 1223 transition count 2131
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 1160 transition count 2130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 1159 transition count 2130
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 128 place count 1159 transition count 2067
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 254 place count 1096 transition count 2067
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 260 place count 1093 transition count 2064
Applied a total of 260 rules in 163 ms. Remains 1093 /1223 variables (removed 130) and now considering 2064/2194 (removed 130) transitions.
[2023-03-23 23:52:07] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-23 23:52:07] [INFO ] Computed 142 place invariants in 63 ms
[2023-03-23 23:52:08] [INFO ] Dead Transitions using invariants and state equation in 1431 ms found 0 transitions.
[2023-03-23 23:52:08] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:52:08] [INFO ] Invariant cache hit.
[2023-03-23 23:52:09] [INFO ] Implicit Places using invariants in 938 ms returned []
[2023-03-23 23:52:09] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:52:09] [INFO ] Invariant cache hit.
[2023-03-23 23:52:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:52:17] [INFO ] Implicit Places using invariants and state equation in 7587 ms returned []
Implicit Place search using SMT with State Equation took 8538 ms to find 0 implicit places.
[2023-03-23 23:52:17] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-23 23:52:17] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:52:17] [INFO ] Invariant cache hit.
[2023-03-23 23:52:18] [INFO ] Dead Transitions using invariants and state equation in 1297 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1093/1223 places, 2064/2194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11478 ms. Remains : 1093/1223 places, 2064/2194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-23 23:52:19] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:52:19] [INFO ] Invariant cache hit.
[2023-03-23 23:52:21] [INFO ] [Real]Absence check using 135 positive place invariants in 195 ms returned sat
[2023-03-23 23:52:21] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 184 ms returned sat
[2023-03-23 23:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:52:26] [INFO ] [Real]Absence check using state equation in 4422 ms returned sat
[2023-03-23 23:52:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:52:29] [INFO ] [Nat]Absence check using 135 positive place invariants in 233 ms returned sat
[2023-03-23 23:52:29] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 129 ms returned sat
[2023-03-23 23:52:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:52:40] [INFO ] [Nat]Absence check using state equation in 10762 ms returned sat
[2023-03-23 23:52:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:52:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 51 ms returned sat
[2023-03-23 23:52:40] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 1 ms to minimize.
[2023-03-23 23:52:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 750 ms
[2023-03-23 23:52:41] [INFO ] Computed and/alt/rep : 1123/4314/1123 causal constraints (skipped 921 transitions) in 163 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 23:52:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14281 reset in 972 ms.
Product exploration explored 100000 steps with 14302 reset in 992 ms.
Support contains 13 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 56 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-23 23:52:43] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:52:43] [INFO ] Invariant cache hit.
[2023-03-23 23:52:44] [INFO ] Dead Transitions using invariants and state equation in 1275 ms found 0 transitions.
[2023-03-23 23:52:44] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:52:44] [INFO ] Invariant cache hit.
[2023-03-23 23:52:45] [INFO ] Implicit Places using invariants in 928 ms returned []
[2023-03-23 23:52:45] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:52:45] [INFO ] Invariant cache hit.
[2023-03-23 23:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:52:52] [INFO ] Implicit Places using invariants and state equation in 6318 ms returned []
Implicit Place search using SMT with State Equation took 7255 ms to find 0 implicit places.
[2023-03-23 23:52:52] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-23 23:52:52] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:52:52] [INFO ] Invariant cache hit.
[2023-03-23 23:52:53] [INFO ] Dead Transitions using invariants and state equation in 1353 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10008 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-04 finished in 72058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 13 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 35 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-23 23:52:53] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-23 23:52:53] [INFO ] Computed 142 place invariants in 41 ms
[2023-03-23 23:52:55] [INFO ] Dead Transitions using invariants and state equation in 1975 ms found 0 transitions.
[2023-03-23 23:52:55] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:52:55] [INFO ] Invariant cache hit.
[2023-03-23 23:52:56] [INFO ] Implicit Places using invariants in 1071 ms returned []
[2023-03-23 23:52:56] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:52:56] [INFO ] Invariant cache hit.
[2023-03-23 23:52:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:53:04] [INFO ] Implicit Places using invariants and state equation in 7526 ms returned []
Implicit Place search using SMT with State Equation took 8613 ms to find 0 implicit places.
[2023-03-23 23:53:04] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:53:04] [INFO ] Invariant cache hit.
[2023-03-23 23:53:06] [INFO ] Dead Transitions using invariants and state equation in 1872 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12524 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s63 1), p1:(OR (AND (GEQ s384 1) (GEQ s1091 1) (GEQ s1092 1)) (AND (GEQ s390 1) (GEQ s1091 1) (GEQ s1092 1)) (AND (GEQ s387 1) (GEQ s1091 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6376 reset in 658 ms.
Product exploration explored 100000 steps with 6374 reset in 715 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-23 23:53:08] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:53:08] [INFO ] Invariant cache hit.
[2023-03-23 23:53:10] [INFO ] [Real]Absence check using 136 positive place invariants in 188 ms returned sat
[2023-03-23 23:53:10] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 66 ms returned sat
[2023-03-23 23:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:53:17] [INFO ] [Real]Absence check using state equation in 6923 ms returned sat
[2023-03-23 23:53:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:53:19] [INFO ] [Nat]Absence check using 136 positive place invariants in 406 ms returned sat
[2023-03-23 23:53:19] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 165 ms returned sat
[2023-03-23 23:53:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:53:27] [INFO ] [Nat]Absence check using state equation in 7685 ms returned sat
[2023-03-23 23:53:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:53:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2023-03-23 23:53:27] [INFO ] Computed and/alt/rep : 1251/3347/1251 causal constraints (skipped 923 transitions) in 162 ms.
[2023-03-23 23:53:28] [INFO ] Added : 3 causal constraints over 1 iterations in 511 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 13 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 34 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-23 23:53:28] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:53:28] [INFO ] Invariant cache hit.
[2023-03-23 23:53:30] [INFO ] Dead Transitions using invariants and state equation in 2074 ms found 0 transitions.
[2023-03-23 23:53:30] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:53:30] [INFO ] Invariant cache hit.
[2023-03-23 23:53:31] [INFO ] Implicit Places using invariants in 1016 ms returned []
[2023-03-23 23:53:31] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:53:31] [INFO ] Invariant cache hit.
[2023-03-23 23:53:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:53:37] [INFO ] Implicit Places using invariants and state equation in 6068 ms returned []
Implicit Place search using SMT with State Equation took 7109 ms to find 0 implicit places.
[2023-03-23 23:53:37] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:53:37] [INFO ] Invariant cache hit.
[2023-03-23 23:53:39] [INFO ] Dead Transitions using invariants and state equation in 1986 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11215 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-23 23:53:39] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:53:39] [INFO ] Invariant cache hit.
[2023-03-23 23:53:41] [INFO ] [Real]Absence check using 136 positive place invariants in 190 ms returned sat
[2023-03-23 23:53:41] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 68 ms returned sat
[2023-03-23 23:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:53:48] [INFO ] [Real]Absence check using state equation in 6865 ms returned sat
[2023-03-23 23:53:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:53:51] [INFO ] [Nat]Absence check using 136 positive place invariants in 395 ms returned sat
[2023-03-23 23:53:51] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 164 ms returned sat
[2023-03-23 23:53:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:53:58] [INFO ] [Nat]Absence check using state equation in 7534 ms returned sat
[2023-03-23 23:53:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:53:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2023-03-23 23:53:59] [INFO ] Computed and/alt/rep : 1251/3347/1251 causal constraints (skipped 923 transitions) in 140 ms.
[2023-03-23 23:53:59] [INFO ] Added : 3 causal constraints over 1 iterations in 409 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6371 reset in 661 ms.
Product exploration explored 100000 steps with 6372 reset in 724 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 13 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1223 transition count 2194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 64 place count 1223 transition count 2195
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 1223 transition count 2195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 1222 transition count 2194
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 1222 transition count 2194
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 129 places in 0 ms
Iterating global reduction 1 with 64 rules applied. Total rules applied 132 place count 1222 transition count 2194
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 195 place count 1159 transition count 2131
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 63 rules applied. Total rules applied 258 place count 1159 transition count 2131
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 258 rules in 561 ms. Remains 1159 /1223 variables (removed 64) and now considering 2131/2194 (removed 63) transitions.
[2023-03-23 23:54:01] [INFO ] Flow matrix only has 2122 transitions (discarded 9 similar events)
// Phase 1: matrix 2122 rows 1159 cols
[2023-03-23 23:54:01] [INFO ] Computed 142 place invariants in 55 ms
[2023-03-23 23:54:04] [INFO ] Dead Transitions using invariants and state equation in 3080 ms found 0 transitions.
[2023-03-23 23:54:04] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-23 23:54:04] [INFO ] Flow matrix only has 2122 transitions (discarded 9 similar events)
[2023-03-23 23:54:04] [INFO ] Invariant cache hit.
[2023-03-23 23:54:07] [INFO ] Dead Transitions using invariants and state equation in 2679 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1159/1223 places, 2131/2194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6393 ms. Remains : 1159/1223 places, 2131/2194 transitions.
Support contains 13 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 25 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-23 23:54:07] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-23 23:54:07] [INFO ] Computed 142 place invariants in 42 ms
[2023-03-23 23:54:09] [INFO ] Dead Transitions using invariants and state equation in 1997 ms found 0 transitions.
[2023-03-23 23:54:09] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:54:09] [INFO ] Invariant cache hit.
[2023-03-23 23:54:10] [INFO ] Implicit Places using invariants in 1095 ms returned []
[2023-03-23 23:54:10] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:54:10] [INFO ] Invariant cache hit.
[2023-03-23 23:54:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:54:18] [INFO ] Implicit Places using invariants and state equation in 8168 ms returned []
Implicit Place search using SMT with State Equation took 9285 ms to find 0 implicit places.
[2023-03-23 23:54:18] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:54:18] [INFO ] Invariant cache hit.
[2023-03-23 23:54:20] [INFO ] Dead Transitions using invariants and state equation in 1877 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13218 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-05 finished in 86988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F((p0&&X(p1)))&&G(p2))))))'
Support contains 76 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 24 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-23 23:54:20] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:54:20] [INFO ] Invariant cache hit.
[2023-03-23 23:54:22] [INFO ] Dead Transitions using invariants and state equation in 2026 ms found 0 transitions.
[2023-03-23 23:54:22] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:54:22] [INFO ] Invariant cache hit.
[2023-03-23 23:54:24] [INFO ] Implicit Places using invariants in 1063 ms returned []
[2023-03-23 23:54:24] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:54:24] [INFO ] Invariant cache hit.
[2023-03-23 23:54:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:54:33] [INFO ] Implicit Places using invariants and state equation in 9556 ms returned []
Implicit Place search using SMT with State Equation took 10630 ms to find 0 implicit places.
[2023-03-23 23:54:33] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:54:33] [INFO ] Invariant cache hit.
[2023-03-23 23:54:35] [INFO ] Dead Transitions using invariants and state equation in 1848 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14546 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p2), acceptance={0} source=6 dest: 1}, { cond=(NOT p2), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p2:(GEQ s1090 1), p1:(AND (OR (LT s62 1) (LT s144 1) (LT s186 1)) (OR (LT s62 1) (LT s183 1) (LT s186 1)) (OR (LT s62 1) (LT s173 1) (LT s186 1)) (OR (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-07 finished in 14851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((G(F(!p1))||(p0&&F(!p1)))))))'
Support contains 13 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 33 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-23 23:54:35] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:54:35] [INFO ] Invariant cache hit.
[2023-03-23 23:54:37] [INFO ] Dead Transitions using invariants and state equation in 1897 ms found 0 transitions.
[2023-03-23 23:54:37] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:54:37] [INFO ] Invariant cache hit.
[2023-03-23 23:54:38] [INFO ] Implicit Places using invariants in 1085 ms returned []
[2023-03-23 23:54:38] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:54:38] [INFO ] Invariant cache hit.
[2023-03-23 23:54:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:54:46] [INFO ] Implicit Places using invariants and state equation in 7643 ms returned []
Implicit Place search using SMT with State Equation took 8752 ms to find 0 implicit places.
[2023-03-23 23:54:46] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:54:46] [INFO ] Invariant cache hit.
[2023-03-23 23:54:48] [INFO ] Dead Transitions using invariants and state equation in 1886 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12619 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s1218 1), p1:(OR (AND (GEQ s384 1) (GEQ s1091 1) (GEQ s1092 1)) (AND (GEQ s390 1) (GEQ s1091 1) (GEQ s1092 1)) (AND (GEQ s387 1) (GEQ s1091 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1286 ms.
Product exploration explored 100000 steps with 50000 reset in 1335 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 8 factoid took 198 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J60-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-08 finished in 15662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0||(F(p1)&&F(!p1))))'
Support contains 63 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1223 transition count 2191
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 1220 transition count 2190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 1219 transition count 2190
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 1219 transition count 2187
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 1216 transition count 2187
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 1213 transition count 2184
Applied a total of 20 rules in 134 ms. Remains 1213 /1223 variables (removed 10) and now considering 2184/2194 (removed 10) transitions.
[2023-03-23 23:54:51] [INFO ] Flow matrix only has 2175 transitions (discarded 9 similar events)
// Phase 1: matrix 2175 rows 1213 cols
[2023-03-23 23:54:51] [INFO ] Computed 142 place invariants in 41 ms
[2023-03-23 23:54:53] [INFO ] Dead Transitions using invariants and state equation in 2069 ms found 0 transitions.
[2023-03-23 23:54:53] [INFO ] Flow matrix only has 2175 transitions (discarded 9 similar events)
[2023-03-23 23:54:53] [INFO ] Invariant cache hit.
[2023-03-23 23:54:54] [INFO ] Implicit Places using invariants in 1198 ms returned []
[2023-03-23 23:54:54] [INFO ] Flow matrix only has 2175 transitions (discarded 9 similar events)
[2023-03-23 23:54:54] [INFO ] Invariant cache hit.
[2023-03-23 23:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:55:02] [INFO ] Implicit Places using invariants and state equation in 7704 ms returned []
Implicit Place search using SMT with State Equation took 8915 ms to find 0 implicit places.
[2023-03-23 23:55:02] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-23 23:55:02] [INFO ] Flow matrix only has 2175 transitions (discarded 9 similar events)
[2023-03-23 23:55:02] [INFO ] Invariant cache hit.
[2023-03-23 23:55:04] [INFO ] Dead Transitions using invariants and state equation in 1814 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1213/1223 places, 2184/2194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13038 ms. Remains : 1213/1223 places, 2184/2194 transitions.
Stuttering acceptance computed with spot in 118 ms :[p1, (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (GEQ s1151 1) (GEQ s1153 1) (GEQ s1155 1) (GEQ s1157 1) (GEQ s1159 1) (GEQ s1161 1) (GEQ s1163 1) (GEQ s1165 1) (GEQ s1200 1) (GEQ s1198 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-09 finished in 13179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p1 U p2))||p0))))'
Support contains 84 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 26 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-23 23:55:04] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-23 23:55:04] [INFO ] Computed 142 place invariants in 66 ms
[2023-03-23 23:55:06] [INFO ] Dead Transitions using invariants and state equation in 2060 ms found 0 transitions.
[2023-03-23 23:55:06] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:55:06] [INFO ] Invariant cache hit.
[2023-03-23 23:55:07] [INFO ] Implicit Places using invariants in 949 ms returned []
[2023-03-23 23:55:07] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:55:07] [INFO ] Invariant cache hit.
[2023-03-23 23:55:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:55:15] [INFO ] Implicit Places using invariants and state equation in 7659 ms returned []
Implicit Place search using SMT with State Equation took 8640 ms to find 0 implicit places.
[2023-03-23 23:55:15] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:55:15] [INFO ] Invariant cache hit.
[2023-03-23 23:55:17] [INFO ] Dead Transitions using invariants and state equation in 1912 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12679 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (AND (GEQ s383 1) (GEQ s384 2) (GEQ s385 2) (GEQ s394 6)) (AND (GEQ s383 1) (GEQ s385 1) (GEQ s391 2) (GEQ s392 1) (GEQ s394 6)) (AND (GEQ s383 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 4 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-11 finished in 12854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 124 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 31 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-23 23:55:17] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:55:17] [INFO ] Invariant cache hit.
[2023-03-23 23:55:19] [INFO ] Dead Transitions using invariants and state equation in 1924 ms found 0 transitions.
[2023-03-23 23:55:19] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:55:19] [INFO ] Invariant cache hit.
[2023-03-23 23:55:20] [INFO ] Implicit Places using invariants in 1079 ms returned []
[2023-03-23 23:55:20] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:55:20] [INFO ] Invariant cache hit.
[2023-03-23 23:55:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:55:28] [INFO ] Implicit Places using invariants and state equation in 7551 ms returned []
Implicit Place search using SMT with State Equation took 8653 ms to find 0 implicit places.
[2023-03-23 23:55:28] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:55:28] [INFO ] Invariant cache hit.
[2023-03-23 23:55:29] [INFO ] Dead Transitions using invariants and state equation in 1898 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12518 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s3 1) (GEQ s5 1) (GEQ s7 1) (GEQ s9 1) (GEQ s11 1) (GEQ s13 1) (GEQ s15 1) (GEQ s17 1) (GEQ s19 1) (GEQ s21 1) (GEQ s23 1) (GEQ s25...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-12 finished in 12687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(F(p0)&&p1)))))'
Support contains 126 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 26 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-23 23:55:30] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:55:30] [INFO ] Invariant cache hit.
[2023-03-23 23:55:32] [INFO ] Dead Transitions using invariants and state equation in 1897 ms found 0 transitions.
[2023-03-23 23:55:32] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:55:32] [INFO ] Invariant cache hit.
[2023-03-23 23:55:33] [INFO ] Implicit Places using invariants in 998 ms returned []
[2023-03-23 23:55:33] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:55:33] [INFO ] Invariant cache hit.
[2023-03-23 23:55:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:55:42] [INFO ] Implicit Places using invariants and state equation in 9666 ms returned []
Implicit Place search using SMT with State Equation took 10668 ms to find 0 implicit places.
[2023-03-23 23:55:42] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:55:42] [INFO ] Invariant cache hit.
[2023-03-23 23:55:44] [INFO ] Dead Transitions using invariants and state equation in 1849 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14455 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s62 1) (LT s144 1) (LT s186 1)) (OR (LT s62 1) (LT s183 1) (LT s186 1)) (OR (LT s62 1) (LT s173 1) (LT s186 1)) (OR (LT s62 1) (LT s134 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1527 ms.
Product exploration explored 100000 steps with 50000 reset in 1576 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J60-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-13 finished in 17879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 1223 transition count 2129
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 1158 transition count 2129
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 1158 transition count 2064
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 1093 transition count 2064
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 266 place count 1090 transition count 2061
Applied a total of 266 rules in 100 ms. Remains 1090 /1223 variables (removed 133) and now considering 2061/2194 (removed 133) transitions.
[2023-03-23 23:55:48] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-23 23:55:48] [INFO ] Computed 142 place invariants in 42 ms
[2023-03-23 23:55:49] [INFO ] Dead Transitions using invariants and state equation in 1362 ms found 0 transitions.
[2023-03-23 23:55:49] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-23 23:55:49] [INFO ] Invariant cache hit.
[2023-03-23 23:55:50] [INFO ] Implicit Places using invariants in 978 ms returned []
[2023-03-23 23:55:50] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-23 23:55:50] [INFO ] Invariant cache hit.
[2023-03-23 23:55:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:55:56] [INFO ] Implicit Places using invariants and state equation in 6083 ms returned []
Implicit Place search using SMT with State Equation took 7069 ms to find 0 implicit places.
[2023-03-23 23:55:56] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-23 23:55:56] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-23 23:55:56] [INFO ] Invariant cache hit.
[2023-03-23 23:55:57] [INFO ] Dead Transitions using invariants and state equation in 1331 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1090/1223 places, 2061/2194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9936 ms. Remains : 1090/1223 places, 2061/2194 transitions.
Stuttering acceptance computed with spot in 33 ms :[p0]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s376 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7350 reset in 1103 ms.
Product exploration explored 100000 steps with 7405 reset in 1107 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Finished random walk after 411 steps, including 32 resets, run visited all 1 properties in 9 ms. (steps per millisecond=45 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 42 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-23 23:56:00] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-23 23:56:00] [INFO ] Invariant cache hit.
[2023-03-23 23:56:01] [INFO ] Dead Transitions using invariants and state equation in 1348 ms found 0 transitions.
[2023-03-23 23:56:01] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-23 23:56:02] [INFO ] Invariant cache hit.
[2023-03-23 23:56:03] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2023-03-23 23:56:03] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-23 23:56:03] [INFO ] Invariant cache hit.
[2023-03-23 23:56:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:56:09] [INFO ] Implicit Places using invariants and state equation in 6596 ms returned []
Implicit Place search using SMT with State Equation took 7614 ms to find 0 implicit places.
[2023-03-23 23:56:09] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-23 23:56:09] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-23 23:56:09] [INFO ] Invariant cache hit.
[2023-03-23 23:56:11] [INFO ] Dead Transitions using invariants and state equation in 1387 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10476 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 327 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Finished random walk after 336 steps, including 23 resets, run visited all 1 properties in 8 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering acceptance computed with spot in 28 ms :[p0]
Product exploration explored 100000 steps with 7284 reset in 1097 ms.
Product exploration explored 100000 steps with 7386 reset in 1103 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 39 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-23 23:56:13] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-23 23:56:13] [INFO ] Invariant cache hit.
[2023-03-23 23:56:15] [INFO ] Dead Transitions using invariants and state equation in 1340 ms found 0 transitions.
[2023-03-23 23:56:15] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-23 23:56:15] [INFO ] Invariant cache hit.
[2023-03-23 23:56:16] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2023-03-23 23:56:16] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-23 23:56:16] [INFO ] Invariant cache hit.
[2023-03-23 23:56:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:56:22] [INFO ] Implicit Places using invariants and state equation in 6446 ms returned []
Implicit Place search using SMT with State Equation took 7462 ms to find 0 implicit places.
[2023-03-23 23:56:22] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-23 23:56:22] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-23 23:56:22] [INFO ] Invariant cache hit.
[2023-03-23 23:56:24] [INFO ] Dead Transitions using invariants and state equation in 1369 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10304 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-14 finished in 36366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 14 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 25 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2023-03-23 23:56:24] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2023-03-23 23:56:24] [INFO ] Computed 142 place invariants in 34 ms
[2023-03-23 23:56:26] [INFO ] Dead Transitions using invariants and state equation in 1986 ms found 0 transitions.
[2023-03-23 23:56:26] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:56:26] [INFO ] Invariant cache hit.
[2023-03-23 23:56:27] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2023-03-23 23:56:27] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:56:27] [INFO ] Invariant cache hit.
[2023-03-23 23:56:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:56:35] [INFO ] Implicit Places using invariants and state equation in 8373 ms returned []
Implicit Place search using SMT with State Equation took 9467 ms to find 0 implicit places.
[2023-03-23 23:56:35] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
[2023-03-23 23:56:35] [INFO ] Invariant cache hit.
[2023-03-23 23:56:37] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13393 ms. Remains : 1223/1223 places, 2194/2194 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s314 1) (GEQ s1015 1)), p0:(OR (AND (GEQ s383 1) (GEQ s390 1) (GEQ s391 2) (GEQ s394 7)) (AND (GEQ s383 1) (GEQ s384 1) (GEQ s385 1) (GEQ s38...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-15 finished in 13517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : PolyORBNT-COL-S10J60-LTLFireability-04
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 13 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 1223 transition count 2131
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 1160 transition count 2130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 1159 transition count 2130
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 128 place count 1159 transition count 2067
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 254 place count 1096 transition count 2067
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 260 place count 1093 transition count 2064
Applied a total of 260 rules in 146 ms. Remains 1093 /1223 variables (removed 130) and now considering 2064/2194 (removed 130) transitions.
[2023-03-23 23:56:38] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-23 23:56:38] [INFO ] Computed 142 place invariants in 35 ms
[2023-03-23 23:56:39] [INFO ] Dead Transitions using invariants and state equation in 1730 ms found 0 transitions.
[2023-03-23 23:56:39] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:56:39] [INFO ] Invariant cache hit.
[2023-03-23 23:56:40] [INFO ] Implicit Places using invariants in 877 ms returned []
[2023-03-23 23:56:40] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:56:40] [INFO ] Invariant cache hit.
[2023-03-23 23:56:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:56:49] [INFO ] Implicit Places using invariants and state equation in 8553 ms returned []
Implicit Place search using SMT with State Equation took 9441 ms to find 0 implicit places.
[2023-03-23 23:56:49] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:56:49] [INFO ] Invariant cache hit.
[2023-03-23 23:56:50] [INFO ] Dead Transitions using invariants and state equation in 1344 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1093/1223 places, 2064/2194 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12687 ms. Remains : 1093/1223 places, 2064/2194 transitions.
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s1089 1) (AND (GEQ s379 1) (GEQ s382 1) (GEQ s384 1) (GEQ s390 8)) (AND (GEQ s379 1) (GEQ s381 2) (GEQ s390 8)) (AND (GEQ s379 1) (GEQ s384 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 14349 reset in 872 ms.
Product exploration explored 100000 steps with 14283 reset in 909 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 239 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
[2023-03-23 23:56:53] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:56:53] [INFO ] Invariant cache hit.
[2023-03-23 23:56:55] [INFO ] [Real]Absence check using 135 positive place invariants in 188 ms returned sat
[2023-03-23 23:56:55] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 182 ms returned sat
[2023-03-23 23:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:57:00] [INFO ] [Real]Absence check using state equation in 4398 ms returned sat
[2023-03-23 23:57:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:57:03] [INFO ] [Nat]Absence check using 135 positive place invariants in 217 ms returned sat
[2023-03-23 23:57:03] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 128 ms returned sat
[2023-03-23 23:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:57:13] [INFO ] [Nat]Absence check using state equation in 10733 ms returned sat
[2023-03-23 23:57:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:57:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2023-03-23 23:57:14] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 3 ms to minimize.
[2023-03-23 23:57:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 680 ms
[2023-03-23 23:57:14] [INFO ] Computed and/alt/rep : 1123/4314/1123 causal constraints (skipped 921 transitions) in 145 ms.
[2023-03-23 23:57:16] [INFO ] Deduced a trap composed of 3 places in 795 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 23:57:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 13 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 48 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-23 23:57:16] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:57:16] [INFO ] Invariant cache hit.
[2023-03-23 23:57:17] [INFO ] Dead Transitions using invariants and state equation in 1479 ms found 0 transitions.
[2023-03-23 23:57:17] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:57:17] [INFO ] Invariant cache hit.
[2023-03-23 23:57:18] [INFO ] Implicit Places using invariants in 922 ms returned []
[2023-03-23 23:57:18] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:57:18] [INFO ] Invariant cache hit.
[2023-03-23 23:57:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:57:26] [INFO ] Implicit Places using invariants and state equation in 8135 ms returned []
Implicit Place search using SMT with State Equation took 9077 ms to find 0 implicit places.
[2023-03-23 23:57:26] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-23 23:57:26] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:57:26] [INFO ] Invariant cache hit.
[2023-03-23 23:57:28] [INFO ] Dead Transitions using invariants and state equation in 1335 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12015 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2023-03-23 23:57:28] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:57:28] [INFO ] Invariant cache hit.
[2023-03-23 23:57:31] [INFO ] [Real]Absence check using 135 positive place invariants in 189 ms returned sat
[2023-03-23 23:57:31] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 173 ms returned sat
[2023-03-23 23:57:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:57:35] [INFO ] [Real]Absence check using state equation in 4166 ms returned sat
[2023-03-23 23:57:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:57:38] [INFO ] [Nat]Absence check using 135 positive place invariants in 219 ms returned sat
[2023-03-23 23:57:38] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 143 ms returned sat
[2023-03-23 23:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:57:49] [INFO ] [Nat]Absence check using state equation in 10638 ms returned sat
[2023-03-23 23:57:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:57:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 24 ms returned sat
[2023-03-23 23:57:49] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 2 ms to minimize.
[2023-03-23 23:57:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 718 ms
[2023-03-23 23:57:49] [INFO ] Computed and/alt/rep : 1123/4314/1123 causal constraints (skipped 921 transitions) in 163 ms.
[2023-03-23 23:57:50] [INFO ] Added : 26 causal constraints over 6 iterations in 953 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14315 reset in 963 ms.
Product exploration explored 100000 steps with 14342 reset in 990 ms.
Support contains 13 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 46 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-23 23:57:52] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:57:52] [INFO ] Invariant cache hit.
[2023-03-23 23:57:54] [INFO ] Dead Transitions using invariants and state equation in 1423 ms found 0 transitions.
[2023-03-23 23:57:54] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:57:54] [INFO ] Invariant cache hit.
[2023-03-23 23:57:55] [INFO ] Implicit Places using invariants in 967 ms returned []
[2023-03-23 23:57:55] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:57:55] [INFO ] Invariant cache hit.
[2023-03-23 23:57:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:57:59] [INFO ] Implicit Places using invariants and state equation in 4585 ms returned []
Implicit Place search using SMT with State Equation took 5558 ms to find 0 implicit places.
[2023-03-23 23:57:59] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-23 23:57:59] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:57:59] [INFO ] Invariant cache hit.
[2023-03-23 23:58:01] [INFO ] Dead Transitions using invariants and state equation in 1364 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8446 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-04 finished in 83441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Found a Shortening insensitive property : PolyORBNT-COL-S10J60-LTLFireability-05
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 13 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1223 transition count 2130
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 1159 transition count 2130
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 128 place count 1159 transition count 2066
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 256 place count 1095 transition count 2066
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 2 with 4 rules applied. Total rules applied 260 place count 1093 transition count 2064
Applied a total of 260 rules in 130 ms. Remains 1093 /1223 variables (removed 130) and now considering 2064/2194 (removed 130) transitions.
[2023-03-23 23:58:01] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-23 23:58:01] [INFO ] Computed 142 place invariants in 35 ms
[2023-03-23 23:58:03] [INFO ] Dead Transitions using invariants and state equation in 1608 ms found 0 transitions.
[2023-03-23 23:58:03] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:58:03] [INFO ] Invariant cache hit.
[2023-03-23 23:58:04] [INFO ] Implicit Places using invariants in 1015 ms returned []
[2023-03-23 23:58:04] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:58:04] [INFO ] Invariant cache hit.
[2023-03-23 23:58:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:58:12] [INFO ] Implicit Places using invariants and state equation in 8473 ms returned []
Implicit Place search using SMT with State Equation took 9499 ms to find 0 implicit places.
[2023-03-23 23:58:12] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:58:12] [INFO ] Invariant cache hit.
[2023-03-23 23:58:14] [INFO ] Dead Transitions using invariants and state equation in 1327 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1093/1223 places, 2064/2194 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12597 ms. Remains : 1093/1223 places, 2064/2194 transitions.
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s63 1), p1:(OR (AND (GEQ s380 1) (GEQ s1087 1) (GEQ s1088 1)) (AND (GEQ s386 1) (GEQ s1087 1) (GEQ s1088 1)) (AND (GEQ s383 1) (GEQ s1087 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9506 reset in 1035 ms.
Product exploration explored 100000 steps with 9534 reset in 1077 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-23 23:58:16] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:58:16] [INFO ] Invariant cache hit.
[2023-03-23 23:58:18] [INFO ] [Real]Absence check using 135 positive place invariants in 187 ms returned sat
[2023-03-23 23:58:18] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 100 ms returned sat
[2023-03-23 23:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:58:22] [INFO ] [Real]Absence check using state equation in 4298 ms returned sat
[2023-03-23 23:58:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:58:24] [INFO ] [Nat]Absence check using 135 positive place invariants in 195 ms returned sat
[2023-03-23 23:58:25] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 299 ms returned sat
[2023-03-23 23:58:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:58:32] [INFO ] [Nat]Absence check using state equation in 7336 ms returned sat
[2023-03-23 23:58:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:58:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 98 ms returned sat
[2023-03-23 23:58:33] [INFO ] Deduced a trap composed of 454 places in 601 ms of which 1 ms to minimize.
[2023-03-23 23:58:33] [INFO ] Deduced a trap composed of 446 places in 580 ms of which 3 ms to minimize.
[2023-03-23 23:58:34] [INFO ] Deduced a trap composed of 428 places in 603 ms of which 1 ms to minimize.
[2023-03-23 23:58:35] [INFO ] Deduced a trap composed of 432 places in 600 ms of which 4 ms to minimize.
[2023-03-23 23:58:35] [INFO ] Deduced a trap composed of 442 places in 590 ms of which 1 ms to minimize.
[2023-03-23 23:58:36] [INFO ] Deduced a trap composed of 438 places in 623 ms of which 1 ms to minimize.
[2023-03-23 23:58:37] [INFO ] Deduced a trap composed of 440 places in 610 ms of which 1 ms to minimize.
[2023-03-23 23:58:38] [INFO ] Deduced a trap composed of 432 places in 617 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 23:58:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 13 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 21 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-23 23:58:38] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:58:38] [INFO ] Invariant cache hit.
[2023-03-23 23:58:40] [INFO ] Dead Transitions using invariants and state equation in 1375 ms found 0 transitions.
[2023-03-23 23:58:40] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:58:40] [INFO ] Invariant cache hit.
[2023-03-23 23:58:41] [INFO ] Implicit Places using invariants in 1027 ms returned []
[2023-03-23 23:58:41] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:58:41] [INFO ] Invariant cache hit.
[2023-03-23 23:58:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:58:49] [INFO ] Implicit Places using invariants and state equation in 8610 ms returned []
Implicit Place search using SMT with State Equation took 9639 ms to find 0 implicit places.
[2023-03-23 23:58:49] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:58:49] [INFO ] Invariant cache hit.
[2023-03-23 23:58:51] [INFO ] Dead Transitions using invariants and state equation in 1396 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12452 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-23 23:58:51] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:58:51] [INFO ] Invariant cache hit.
[2023-03-23 23:58:53] [INFO ] [Real]Absence check using 135 positive place invariants in 180 ms returned sat
[2023-03-23 23:58:53] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 95 ms returned sat
[2023-03-23 23:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:58:57] [INFO ] [Real]Absence check using state equation in 4461 ms returned sat
[2023-03-23 23:58:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:58:59] [INFO ] [Nat]Absence check using 135 positive place invariants in 194 ms returned sat
[2023-03-23 23:59:00] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 301 ms returned sat
[2023-03-23 23:59:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:59:07] [INFO ] [Nat]Absence check using state equation in 7252 ms returned sat
[2023-03-23 23:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:59:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 82 ms returned sat
[2023-03-23 23:59:07] [INFO ] Deduced a trap composed of 454 places in 574 ms of which 1 ms to minimize.
[2023-03-23 23:59:08] [INFO ] Deduced a trap composed of 446 places in 584 ms of which 3 ms to minimize.
[2023-03-23 23:59:09] [INFO ] Deduced a trap composed of 428 places in 583 ms of which 1 ms to minimize.
[2023-03-23 23:59:10] [INFO ] Deduced a trap composed of 432 places in 542 ms of which 1 ms to minimize.
[2023-03-23 23:59:10] [INFO ] Deduced a trap composed of 442 places in 551 ms of which 1 ms to minimize.
[2023-03-23 23:59:11] [INFO ] Deduced a trap composed of 438 places in 544 ms of which 1 ms to minimize.
[2023-03-23 23:59:12] [INFO ] Deduced a trap composed of 440 places in 546 ms of which 1 ms to minimize.
[2023-03-23 23:59:13] [INFO ] Deduced a trap composed of 432 places in 541 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 23:59:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9544 reset in 1046 ms.
Product exploration explored 100000 steps with 9490 reset in 1038 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 13 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 47 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-23 23:59:15] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:59:15] [INFO ] Invariant cache hit.
[2023-03-23 23:59:16] [INFO ] Dead Transitions using invariants and state equation in 1292 ms found 0 transitions.
[2023-03-23 23:59:16] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-23 23:59:16] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:59:16] [INFO ] Invariant cache hit.
[2023-03-23 23:59:18] [INFO ] Dead Transitions using invariants and state equation in 1293 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2673 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Support contains 13 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 19 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2023-03-23 23:59:18] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:59:18] [INFO ] Invariant cache hit.
[2023-03-23 23:59:19] [INFO ] Dead Transitions using invariants and state equation in 1365 ms found 0 transitions.
[2023-03-23 23:59:19] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:59:19] [INFO ] Invariant cache hit.
[2023-03-23 23:59:20] [INFO ] Implicit Places using invariants in 949 ms returned []
[2023-03-23 23:59:20] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:59:20] [INFO ] Invariant cache hit.
[2023-03-23 23:59:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:59:27] [INFO ] Implicit Places using invariants and state equation in 7270 ms returned []
Implicit Place search using SMT with State Equation took 8221 ms to find 0 implicit places.
[2023-03-23 23:59:27] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
[2023-03-23 23:59:27] [INFO ] Invariant cache hit.
[2023-03-23 23:59:29] [INFO ] Dead Transitions using invariants and state equation in 1361 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10969 ms. Remains : 1093/1093 places, 2064/2064 transitions.
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-05 finished in 88036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
[2023-03-23 23:59:29] [INFO ] Flatten gal took : 106 ms
[2023-03-23 23:59:29] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-23 23:59:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1223 places, 2194 transitions and 12082 arcs took 12 ms.
Total runtime 560358 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1832/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1832/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1832/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBNT-COL-S10J60-LTLFireability-04
Could not compute solution for formula : PolyORBNT-COL-S10J60-LTLFireability-05
Could not compute solution for formula : PolyORBNT-COL-S10J60-LTLFireability-14

BK_STOP 1679615972500

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name PolyORBNT-COL-S10J60-LTLFireability-04
ltl formula formula --ltl=/tmp/1832/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1223 places, 2194 transitions and 12082 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.090 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1832/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1832/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1832/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1832/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name PolyORBNT-COL-S10J60-LTLFireability-05
ltl formula formula --ltl=/tmp/1832/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1223 places, 2194 transitions and 12082 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.080 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1832/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1832/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1832/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1832/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name PolyORBNT-COL-S10J60-LTLFireability-14
ltl formula formula --ltl=/tmp/1832/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1223 places, 2194 transitions and 12082 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.080 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1832/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1832/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1832/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1832/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="PolyORBNT-COL-S10J60"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-COL-S10J60, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950800700"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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