MCC'2024- Execution of r631-smll-171774447000012

About the Execution of LTSMin+red for ResIsolation-PT-N08P2

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16190.792	3333023.00	5063202.00	8822.50	TFFFFFTFTFFFTTFT	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r631-smll-171774447000012.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ResIsolation-PT-N08P2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r631-smll-171774447000012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.5M
-rw-r--r-- 1 mcc users 5.6K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 9.2M Jun 7 06:26 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 ResIsolation-PT-N08P2-LTLFireability-00
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-01
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-02
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-03
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-04
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-05
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-06
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-07
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-08
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-09
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-10
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-11
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-12
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-13
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-14
FORMULA_NAME ResIsolation-PT-N08P2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717749830195

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResIsolation-PT-N08P2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 08:43:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 08:43:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 08:43:53] [INFO ] Load time of PNML (sax parser for PT used): 1174 ms
[2024-06-07 08:43:53] [INFO ] Transformed 309 places.
[2024-06-07 08:43:53] [INFO ] Transformed 9493 transitions.
[2024-06-07 08:43:53] [INFO ] Found NUPN structural information;
[2024-06-07 08:43:53] [INFO ] Parsed PT model containing 309 places and 9493 transitions and 184883 arcs in 1562 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ResIsolation-PT-N08P2-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P2-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P2-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P2-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 9493/9493 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 299 transition count 9493
Discarding 167 places :
Symmetric choice reduction at 1 with 167 rule applications. Total rules 177 place count 132 transition count 9326
Iterating global reduction 1 with 167 rules applied. Total rules applied 344 place count 132 transition count 9326
Ensure Unique test removed 773 transitions
Reduce isomorphic transitions removed 773 transitions.
Iterating post reduction 1 with 773 rules applied. Total rules applied 1117 place count 132 transition count 8553
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1134 place count 115 transition count 8536
Iterating global reduction 2 with 17 rules applied. Total rules applied 1151 place count 115 transition count 8536
Applied a total of 1151 rules in 446 ms. Remains 115 /309 variables (removed 194) and now considering 8536/9493 (removed 957) transitions.
// Phase 1: matrix 8536 rows 115 cols
[2024-06-07 08:43:55] [INFO ] Computed 0 invariants in 389 ms
[2024-06-07 08:43:56] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2024-06-07 08:43:56] [INFO ] Invariant cache hit.
[2024-06-07 08:44:01] [INFO ] Implicit Places using invariants and state equation in 5582 ms returned []
Implicit Place search using SMT with State Equation took 6885 ms to find 0 implicit places.
Running 8535 sub problems to find dead transitions.
[2024-06-07 08:44:02] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30337 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8535/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8535 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30135 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8461/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 214033ms problems are : Problem set: 0 solved, 8535 unsolved
Search for dead transitions found 0 dead transitions in 214381ms
Starting structural reductions in LTL mode, iteration 1 : 115/309 places, 8536/9493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221903 ms. Remains : 115/309 places, 8536/9493 transitions.
Support contains 40 out of 115 places after structural reductions.
[2024-06-07 08:47:38] [INFO ] Flatten gal took : 1928 ms
[2024-06-07 08:47:40] [INFO ] Flatten gal took : 1415 ms
[2024-06-07 08:47:43] [INFO ] Input system was already deterministic with 8536 transitions.
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 40000 steps (8 resets) in 6672 ms. (5 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 220043 steps, run timeout after 6001 ms. (steps per millisecond=36 ) properties seen :3 out of 16
Probabilistic random walk after 220043 steps, saw 38552 distinct states, run finished after 6009 ms. (steps per millisecond=36 ) properties seen :3
[2024-06-07 08:47:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 8470/8509 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8509 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8569/8651 variables, and 72 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5018 ms.
Refiners :[State Equation: 72/115 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 8470/8509 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8509 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 60/8569 variables, 33/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8569/8651 variables, and 72 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5012 ms.
Refiners :[State Equation: 72/115 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10780ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 8536/8536 transitions.
Graph (complete) has 861 edges and 115 vertex of which 113 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.91 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 113 transition count 8502
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 55 place count 91 transition count 8502
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 107 place count 65 transition count 8476
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 65 transition count 8471
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 117 place count 60 transition count 8471
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 60 transition count 8470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 59 transition count 8469
Applied a total of 119 rules in 4403 ms. Remains 59 /115 variables (removed 56) and now considering 8469/8536 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4406 ms. Remains : 59/115 places, 8469/8536 transitions.
RANDOM walk for 40000 steps (8 resets) in 5418 ms. (7 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 256179 steps, run timeout after 6001 ms. (steps per millisecond=42 ) properties seen :1 out of 13
Probabilistic random walk after 256179 steps, saw 37745 distinct states, run finished after 6001 ms. (steps per millisecond=42 ) properties seen :1
// Phase 1: matrix 8469 rows 59 cols
[2024-06-07 08:48:15] [INFO ] Computed 10 invariants in 61 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 20/59 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 8469/8528 variables, 59/69 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8528 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/8528 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8528/8528 variables, and 69 constraints, problems are : Problem set: 2 solved, 10 unsolved in 13618 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 22/59 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 8469/8528 variables, 59/69 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8528 variables, 0/69 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/8528 variables, 0/69 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8528/8528 variables, and 69 constraints, problems are : Problem set: 3 solved, 9 unsolved in 11923 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 25956ms problems are : Problem set: 3 solved, 9 unsolved
Parikh walk visited 6 properties in 4189 ms.
Support contains 22 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 8469/8469 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 59 transition count 8468
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 8468
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 58 transition count 8464
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 260 rules applied. Total rules applied 266 place count 54 transition count 8208
Applied a total of 266 rules in 7593 ms. Remains 54 /59 variables (removed 5) and now considering 8208/8469 (removed 261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7594 ms. Remains : 54/59 places, 8208/8469 transitions.
RANDOM walk for 40000 steps (8 resets) in 5434 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 156626 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 3
Probabilistic random walk after 156626 steps, saw 25137 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
// Phase 1: matrix 8208 rows 54 cols
[2024-06-07 08:48:57] [INFO ] Computed 10 invariants in 53 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8208/8262 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8262 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8262 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8262/8262 variables, and 64 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4381 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8208/8262 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8262 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8262 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8262/8262 variables, and 64 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4824 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9440ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 1320 ms.
Support contains 10 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 8208/8208 transitions.
Graph (trivial) has 12 edges and 54 vertex of which 8 / 54 are part of one of the 4 SCC in 10 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 50 transition count 8199
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 49 transition count 8199
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 49 transition count 8196
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1280 transitions
Reduce isomorphic transitions removed 1280 transitions.
Iterating post reduction 0 with 1283 rules applied. Total rules applied 1289 place count 46 transition count 6916
Applied a total of 1289 rules in 15002 ms. Remains 46 /54 variables (removed 8) and now considering 6916/8208 (removed 1292) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15002 ms. Remains : 46/54 places, 6916/8208 transitions.
RANDOM walk for 40000 steps (8 resets) in 8026 ms. (4 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 24752 steps, run visited all 1 properties in 610 ms. (steps per millisecond=40 )
Probabilistic random walk after 24752 steps, saw 7615 distinct states, run finished after 619 ms. (steps per millisecond=39 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA ResIsolation-PT-N08P2-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 39 stabilizing places and 49 stable transitions
Graph (complete) has 861 edges and 115 vertex of which 113 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.199 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 8536/8536 transitions.
Applied a total of 0 rules in 88 ms. Remains 115 /115 variables (removed 0) and now considering 8536/8536 (removed 0) transitions.
// Phase 1: matrix 8536 rows 115 cols
[2024-06-07 08:49:26] [INFO ] Computed 0 invariants in 202 ms
[2024-06-07 08:49:28] [INFO ] Implicit Places using invariants in 2429 ms returned []
[2024-06-07 08:49:28] [INFO ] Invariant cache hit.
[2024-06-07 08:49:36] [INFO ] Implicit Places using invariants and state equation in 8085 ms returned []
Implicit Place search using SMT with State Equation took 10525 ms to find 0 implicit places.
Running 8535 sub problems to find dead transitions.
[2024-06-07 08:49:37] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30152 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8535/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30137 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8461/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 222748ms problems are : Problem set: 0 solved, 8535 unsolved
Search for dead transitions found 0 dead transitions in 222947ms
Finished structural reductions in LTL mode , in 1 iterations and 233635 ms. Remains : 115/115 places, 8536/8536 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 961 ms.
Product exploration explored 100000 steps with 50000 reset in 768 ms.
Computed a total of 39 stabilizing places and 49 stable transitions
Graph (complete) has 861 edges and 115 vertex of which 113 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.143 ms
Computed a total of 39 stabilizing places and 49 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P2-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P2-LTLFireability-00 finished in 236496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 10 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 8536/8536 transitions.
Applied a total of 0 rules in 56 ms. Remains 115 /115 variables (removed 0) and now considering 8536/8536 (removed 0) transitions.
[2024-06-07 08:53:22] [INFO ] Invariant cache hit.
[2024-06-07 08:53:24] [INFO ] Implicit Places using invariants in 1489 ms returned []
[2024-06-07 08:53:24] [INFO ] Invariant cache hit.
[2024-06-07 08:53:30] [INFO ] Implicit Places using invariants and state equation in 6003 ms returned []
Implicit Place search using SMT with State Equation took 7512 ms to find 0 implicit places.
Running 8535 sub problems to find dead transitions.
[2024-06-07 08:53:30] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30134 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8535/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30157 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8461/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 227913ms problems are : Problem set: 0 solved, 8535 unsolved
Search for dead transitions found 0 dead transitions in 228022ms
Finished structural reductions in LTL mode , in 1 iterations and 235616 ms. Remains : 115/115 places, 8536/8536 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, p0, p0]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 2933 ms.
Product exploration explored 100000 steps with 0 reset in 3017 ms.
Computed a total of 39 stabilizing places and 49 stable transitions
Graph (complete) has 861 edges and 115 vertex of which 113 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.94 ms
Computed a total of 39 stabilizing places and 49 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, p0]
RANDOM walk for 40000 steps (8 resets) in 2626 ms. (15 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7949 steps, run visited all 1 properties in 190 ms. (steps per millisecond=41 )
Probabilistic random walk after 7949 steps, saw 5030 distinct states, run finished after 191 ms. (steps per millisecond=41 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P2-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P2-LTLFireability-01 finished in 243240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 8536/8536 transitions.
Applied a total of 0 rules in 55 ms. Remains 115 /115 variables (removed 0) and now considering 8536/8536 (removed 0) transitions.
[2024-06-07 08:57:26] [INFO ] Invariant cache hit.
[2024-06-07 08:57:27] [INFO ] Implicit Places using invariants in 1437 ms returned []
[2024-06-07 08:57:27] [INFO ] Invariant cache hit.
[2024-06-07 08:57:33] [INFO ] Implicit Places using invariants and state equation in 6050 ms returned []
Implicit Place search using SMT with State Equation took 7507 ms to find 0 implicit places.
Running 8535 sub problems to find dead transitions.
[2024-06-07 08:57:33] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30149 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8535/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8535 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30144 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8461/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 227219ms problems are : Problem set: 0 solved, 8535 unsolved
Search for dead transitions found 0 dead transitions in 227329ms
Finished structural reductions in LTL mode , in 1 iterations and 234914 ms. Remains : 115/115 places, 8536/8536 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResIsolation-PT-N08P2-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P2-LTLFireability-02 finished in 235046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 8536/8536 transitions.
Graph (complete) has 861 edges and 115 vertex of which 113 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.226 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 112 transition count 8519
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 98 transition count 8519
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 98 transition count 8509
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 88 transition count 8509
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 81 place count 72 transition count 8493
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 87 place count 69 transition count 8501
Applied a total of 87 rules in 2204 ms. Remains 69 /115 variables (removed 46) and now considering 8501/8536 (removed 35) transitions.
// Phase 1: matrix 8501 rows 69 cols
[2024-06-07 09:01:23] [INFO ] Computed 0 invariants in 205 ms
[2024-06-07 09:01:24] [INFO ] Implicit Places using invariants in 1655 ms returned []
[2024-06-07 09:01:24] [INFO ] Invariant cache hit.
[2024-06-07 09:01:30] [INFO ] Implicit Places using invariants and state equation in 5594 ms returned []
Implicit Place search using SMT with State Equation took 7270 ms to find 0 implicit places.
[2024-06-07 09:02:06] [INFO ] Redundant transitions in 35694 ms returned []
Running 8483 sub problems to find dead transitions.
[2024-06-07 09:02:06] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 67/8570 variables, and 0 constraints, problems are : Problem set: 0 solved, 8483 unsolved in 30149 ms.
Refiners :[State Equation: 0/69 constraints, PredecessorRefiner: 8483/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8483 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 67/8570 variables, and 0 constraints, problems are : Problem set: 0 solved, 8483 unsolved in 30134 ms.
Refiners :[State Equation: 0/69 constraints, PredecessorRefiner: 8461/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 231002ms problems are : Problem set: 0 solved, 8483 unsolved
Search for dead transitions found 0 dead transitions in 231115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/115 places, 8501/8536 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 276338 ms. Remains : 69/115 places, 8501/8536 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 4174 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA ResIsolation-PT-N08P2-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P2-LTLFireability-03 finished in 280609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 14 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 8536/8536 transitions.
Graph (complete) has 861 edges and 115 vertex of which 113 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.34 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 112 transition count 8519
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 98 transition count 8519
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 98 transition count 8509
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 88 transition count 8509
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 81 place count 72 transition count 8493
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 87 place count 69 transition count 8501
Applied a total of 87 rules in 1378 ms. Remains 69 /115 variables (removed 46) and now considering 8501/8536 (removed 35) transitions.
[2024-06-07 09:06:03] [INFO ] Invariant cache hit.
[2024-06-07 09:06:04] [INFO ] Implicit Places using invariants in 1222 ms returned []
[2024-06-07 09:06:04] [INFO ] Invariant cache hit.
[2024-06-07 09:06:09] [INFO ] Implicit Places using invariants and state equation in 5326 ms returned []
Implicit Place search using SMT with State Equation took 6574 ms to find 0 implicit places.
[2024-06-07 09:06:45] [INFO ] Redundant transitions in 36328 ms returned []
Running 8483 sub problems to find dead transitions.
[2024-06-07 09:06:46] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 67/8570 variables, and 0 constraints, problems are : Problem set: 0 solved, 8483 unsolved in 30133 ms.
Refiners :[State Equation: 0/69 constraints, PredecessorRefiner: 8483/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8483 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 67/8570 variables, and 0 constraints, problems are : Problem set: 0 solved, 8483 unsolved in 30136 ms.
Refiners :[State Equation: 0/69 constraints, PredecessorRefiner: 8461/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 230854ms problems are : Problem set: 0 solved, 8483 unsolved
Search for dead transitions found 0 dead transitions in 230969ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/115 places, 8501/8536 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 275294 ms. Remains : 69/115 places, 8501/8536 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 4166 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA ResIsolation-PT-N08P2-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P2-LTLFireability-04 finished in 279631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(G(p0))||(!p1 U p0))))))'
Support contains 15 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 8536/8536 transitions.
Applied a total of 0 rules in 50 ms. Remains 115 /115 variables (removed 0) and now considering 8536/8536 (removed 0) transitions.
// Phase 1: matrix 8536 rows 115 cols
[2024-06-07 09:10:41] [INFO ] Computed 0 invariants in 124 ms
[2024-06-07 09:10:42] [INFO ] Implicit Places using invariants in 1359 ms returned []
[2024-06-07 09:10:42] [INFO ] Invariant cache hit.
[2024-06-07 09:10:48] [INFO ] Implicit Places using invariants and state equation in 5749 ms returned []
Implicit Place search using SMT with State Equation took 7132 ms to find 0 implicit places.
Running 8535 sub problems to find dead transitions.
[2024-06-07 09:10:48] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30144 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8535/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30136 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8461/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 231980ms problems are : Problem set: 0 solved, 8535 unsolved
Search for dead transitions found 0 dead transitions in 232108ms
Finished structural reductions in LTL mode , in 1 iterations and 239307 ms. Remains : 115/115 places, 8536/8536 transitions.
Stuttering acceptance computed with spot in 285 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 2941 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA ResIsolation-PT-N08P2-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P2-LTLFireability-07 finished in 242661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 15 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 8536/8536 transitions.
Graph (complete) has 861 edges and 115 vertex of which 113 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.32 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 112 transition count 8519
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 98 transition count 8519
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 98 transition count 8509
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 88 transition count 8509
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 81 place count 72 transition count 8493
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 87 place count 69 transition count 8501
Applied a total of 87 rules in 1391 ms. Remains 69 /115 variables (removed 46) and now considering 8501/8536 (removed 35) transitions.
// Phase 1: matrix 8501 rows 69 cols
[2024-06-07 09:14:45] [INFO ] Computed 0 invariants in 116 ms
[2024-06-07 09:14:46] [INFO ] Implicit Places using invariants in 1333 ms returned []
[2024-06-07 09:14:46] [INFO ] Invariant cache hit.
[2024-06-07 09:14:51] [INFO ] Implicit Places using invariants and state equation in 5249 ms returned []
Implicit Place search using SMT with State Equation took 6610 ms to find 0 implicit places.
[2024-06-07 09:15:27] [INFO ] Redundant transitions in 35772 ms returned []
Running 8483 sub problems to find dead transitions.
[2024-06-07 09:15:27] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 67/8570 variables, and 0 constraints, problems are : Problem set: 0 solved, 8483 unsolved in 30132 ms.
Refiners :[State Equation: 0/69 constraints, PredecessorRefiner: 8483/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8483 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 67/8570 variables, and 0 constraints, problems are : Problem set: 0 solved, 8483 unsolved in 30133 ms.
Refiners :[State Equation: 0/69 constraints, PredecessorRefiner: 8461/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 226076ms problems are : Problem set: 0 solved, 8483 unsolved
Search for dead transitions found 0 dead transitions in 226181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/115 places, 8501/8536 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 269976 ms. Remains : 69/115 places, 8501/8536 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 4230 ms.
Product exploration explored 100000 steps with 0 reset in 4218 ms.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 3454 ms. (11 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1252 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 694 ms. (57 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 877 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1000 ms. (39 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 271551 steps, run timeout after 6001 ms. (steps per millisecond=45 ) properties seen :2 out of 4
Probabilistic random walk after 271551 steps, saw 39122 distinct states, run finished after 6001 ms. (steps per millisecond=45 ) properties seen :2
[2024-06-07 09:19:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8459/8474 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8474 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/8556 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8556 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/8570 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8570 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/8570 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 8570/8570 variables, and 69 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4202 ms.
Refiners :[State Equation: 69/69 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8474/8570 variables, and 15 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2664 ms.
Refiners :[State Equation: 15/69 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6988ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 10 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 8501/8501 transitions.
Graph (trivial) has 24 edges and 69 vertex of which 6 / 69 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 66 transition count 8487
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 64 transition count 8487
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 15 place count 59 transition count 8482
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 8481
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 59 transition count 8471
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1536 transitions
Reduce isomorphic transitions removed 1536 transitions.
Iterating post reduction 0 with 1546 rules applied. Total rules applied 1572 place count 49 transition count 6935
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 1573 place count 49 transition count 6935
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 1574 place count 48 transition count 6934
Iterating global reduction 1 with 1 rules applied. Total rules applied 1575 place count 48 transition count 6934
Applied a total of 1575 rules in 30690 ms. Remains 48 /69 variables (removed 21) and now considering 6934/8501 (removed 1567) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30691 ms. Remains : 48/69 places, 6934/8501 transitions.
RANDOM walk for 40000 steps (8 resets) in 2694 ms. (14 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 359 ms. (111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 70468 steps, run visited all 1 properties in 1794 ms. (steps per millisecond=39 )
Probabilistic random walk after 70468 steps, saw 15724 distinct states, run finished after 1794 ms. (steps per millisecond=39 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 21 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P2-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P2-LTLFireability-08 finished in 327980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((X(G(p2))&&p1)))&&p0)))'
Support contains 16 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 8536/8536 transitions.
Applied a total of 0 rules in 48 ms. Remains 115 /115 variables (removed 0) and now considering 8536/8536 (removed 0) transitions.
// Phase 1: matrix 8536 rows 115 cols
[2024-06-07 09:20:12] [INFO ] Computed 0 invariants in 116 ms
[2024-06-07 09:20:13] [INFO ] Implicit Places using invariants in 1532 ms returned []
[2024-06-07 09:20:13] [INFO ] Invariant cache hit.
[2024-06-07 09:20:20] [INFO ] Implicit Places using invariants and state equation in 6508 ms returned []
Implicit Place search using SMT with State Equation took 8045 ms to find 0 implicit places.
Running 8535 sub problems to find dead transitions.
[2024-06-07 09:20:20] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30174 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8535/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30160 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8461/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 228680ms problems are : Problem set: 0 solved, 8535 unsolved
Search for dead transitions found 0 dead transitions in 228850ms
Finished structural reductions in LTL mode , in 1 iterations and 237042 ms. Remains : 115/115 places, 8536/8536 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 3039 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA ResIsolation-PT-N08P2-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P2-LTLFireability-09 finished in 240347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p1)||G(p2)))||p0)))'
Support contains 14 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 8536/8536 transitions.
Applied a total of 0 rules in 54 ms. Remains 115 /115 variables (removed 0) and now considering 8536/8536 (removed 0) transitions.
[2024-06-07 09:24:12] [INFO ] Invariant cache hit.
[2024-06-07 09:24:14] [INFO ] Implicit Places using invariants in 1852 ms returned []
[2024-06-07 09:24:14] [INFO ] Invariant cache hit.
[2024-06-07 09:24:20] [INFO ] Implicit Places using invariants and state equation in 6663 ms returned []
Implicit Place search using SMT with State Equation took 8532 ms to find 0 implicit places.
Running 8535 sub problems to find dead transitions.
[2024-06-07 09:24:21] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30182 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8535/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 114/8651 variables, and 0 constraints, problems are : Problem set: 0 solved, 8535 unsolved in 30145 ms.
Refiners :[State Equation: 0/115 constraints, PredecessorRefiner: 8461/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 228708ms problems are : Problem set: 0 solved, 8535 unsolved
Search for dead transitions found 0 dead transitions in 228827ms
Finished structural reductions in LTL mode , in 1 iterations and 237428 ms. Remains : 115/115 places, 8536/8536 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ResIsolation-PT-N08P2-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 726 ms.
Product exploration explored 100000 steps with 50000 reset in 549 ms.
Computed a total of 39 stabilizing places and 49 stable transitions
Graph (complete) has 861 edges and 115 vertex of which 113 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.102 ms
Computed a total of 39 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P2-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P2-LTLFireability-13 finished in 239078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 13 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 8536/8536 transitions.
Graph (trivial) has 72 edges and 115 vertex of which 12 / 115 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 849 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.34 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 104 transition count 8512
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 91 transition count 8512
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 28 place count 91 transition count 8502
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 48 place count 81 transition count 8502
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 69 transition count 8490
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 66 transition count 8498
Applied a total of 78 rules in 9737 ms. Remains 66 /115 variables (removed 49) and now considering 8498/8536 (removed 38) transitions.
[2024-06-07 09:28:21] [INFO ] Flow matrix only has 8495 transitions (discarded 3 similar events)
// Phase 1: matrix 8495 rows 66 cols
[2024-06-07 09:28:21] [INFO ] Computed 0 invariants in 81 ms
[2024-06-07 09:28:22] [INFO ] Implicit Places using invariants in 1673 ms returned []
[2024-06-07 09:28:22] [INFO ] Flow matrix only has 8495 transitions (discarded 3 similar events)
[2024-06-07 09:28:22] [INFO ] Invariant cache hit.
[2024-06-07 09:28:32] [INFO ] State equation strengthened by 7916 read => feed constraints.
[2024-06-07 09:29:30] [INFO ] Implicit Places using invariants and state equation in 67918 ms returned []
Implicit Place search using SMT with State Equation took 69600 ms to find 0 implicit places.
[2024-06-07 09:30:06] [INFO ] Redundant transitions in 35807 ms returned []
Running 8480 sub problems to find dead transitions.
[2024-06-07 09:30:06] [INFO ] Flow matrix only has 8495 transitions (discarded 3 similar events)
[2024-06-07 09:30:06] [INFO ] Invariant cache hit.
[2024-06-07 09:30:23] [INFO ] State equation strengthened by 7916 read => feed constraints.
FORMULA ResIsolation-PT-N08P2-LTLFireability-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ResIsolation-PT-N08P2-LTLFireability-01
FORMULA ResIsolation-PT-N08P2-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N08P2-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N08P2-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N08P2-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N08P2-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N08P2-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ResIsolation-PT-N08P2-LTLFireability-08
FORMULA ResIsolation-PT-N08P2-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N08P2-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N08P2-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N08P2-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N08P2-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N08P2-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N08P2-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717753163218

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ResIsolation-PT-N08P2-LTLFireability-00
ltl formula formula --ltl=/tmp/999/ltl_0_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.500 real 0.720 user 0.390 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_0_
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): There are 301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9498 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 2
pnml2lts-mc( 0/ 4): unique transitions count: 1
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8 states 8 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 88.0 B/state, compr.: 7.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P2-LTLFireability-01
ltl formula formula --ltl=/tmp/999/ltl_1_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.580 real 0.680 user 0.420 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/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): There are 301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9500 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~184 levels ~10000 states ~94880 transitions
pnml2lts-mc( 3/ 4): ~184 levels ~20000 states ~204656 transitions
pnml2lts-mc( 3/ 4): ~184 levels ~40000 states ~438904 transitions
pnml2lts-mc( 3/ 4): ~184 levels ~80000 states ~913288 transitions
pnml2lts-mc( 3/ 4): ~192 levels ~160000 states ~1855496 transitions
pnml2lts-mc( 1/ 4): ~156 levels ~320000 states ~4191272 transitions
pnml2lts-mc( 1/ 4): ~156 levels ~640000 states ~8588048 transitions
pnml2lts-mc( 3/ 4): ~192 levels ~1280000 states ~16553496 transitions
ltl formula name ResIsolation-PT-N08P2-LTLFireability-02
ltl formula formula --ltl=/tmp/999/ltl_2_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.610 real 0.750 user 0.410 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_2_
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): There are 301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9497 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~15!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 48
pnml2lts-mc( 0/ 4): unique transitions count: 249
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 63
pnml2lts-mc( 0/ 4): - cum. max stack depth: 63
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 63 states 290 transitions, fanout: 4.603
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6300, Transitions per second: 29000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 28.7 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P2-LTLFireability-03
ltl formula formula --ltl=/tmp/999/ltl_3_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.670 real 0.710 user 0.410 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 300 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9497 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~8!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 19
pnml2lts-mc( 0/ 4): unique transitions count: 70
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 28
pnml2lts-mc( 0/ 4): - cum. max stack depth: 28
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28 states 91 transitions, fanout: 3.250
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2800, Transitions per second: 9100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 40.9 B/state, compr.: 3.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P2-LTLFireability-04
ltl formula formula --ltl=/tmp/999/ltl_4_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.600 real 0.720 user 0.430 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_4_
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): There are 301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9498 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~8!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 18
pnml2lts-mc( 0/ 4): unique transitions count: 57
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 28
pnml2lts-mc( 0/ 4): - cum. max stack depth: 28
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28 states 88 transitions, fanout: 3.143
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2800, Transitions per second: 8800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 46.0 B/state, compr.: 3.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P2-LTLFireability-05
ltl formula formula --ltl=/tmp/999/ltl_5_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.480 real 0.770 user 0.330 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_5_
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): There are 301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9498 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~14!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 59
pnml2lts-mc( 0/ 4): unique transitions count: 269
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 67
pnml2lts-mc( 0/ 4): - cum. max stack depth: 67
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 67 states 294 transitions, fanout: 4.388
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3350, Transitions per second: 14700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 31.8 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P2-LTLFireability-06
ltl formula formula --ltl=/tmp/999/ltl_6_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.660 real 0.800 user 0.420 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9494 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 72.0 B/state, compr.: 5.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P2-LTLFireability-07
ltl formula formula --ltl=/tmp/999/ltl_7_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.700 real 0.790 user 0.450 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9507 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~15!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 42
pnml2lts-mc( 0/ 4): unique transitions count: 203
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 53
pnml2lts-mc( 0/ 4): - cum. max stack depth: 53
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 53 states 234 transitions, fanout: 4.415
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5300, Transitions per second: 23400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 34.1 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P2-LTLFireability-08
ltl formula formula --ltl=/tmp/999/ltl_8_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.650 real 0.700 user 0.420 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 300 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9499 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~113 levels ~10000 states ~56284 transitions
pnml2lts-mc( 0/ 4): ~224 levels ~20000 states ~116744 transitions
pnml2lts-mc( 0/ 4): ~224 levels ~40000 states ~243652 transitions
pnml2lts-mc( 0/ 4): ~224 levels ~80000 states ~526944 transitions
pnml2lts-mc( 2/ 4): ~582 levels ~160000 states ~1061256 transitions
pnml2lts-mc( 2/ 4): ~600 levels ~320000 states ~2173664 transitions
pnml2lts-mc( 2/ 4): ~600 levels ~640000 states ~4580960 transitions
ltl formula name ResIsolation-PT-N08P2-LTLFireability-09
ltl formula formula --ltl=/tmp/999/ltl_9_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.660 real 0.770 user 0.430 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 300 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9515 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~13!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 38
pnml2lts-mc( 0/ 4): unique transitions count: 123
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 51
pnml2lts-mc( 0/ 4): - cum. max stack depth: 51
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 51 states 153 transitions, fanout: 3.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5100, Transitions per second: 15300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 37.3 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P2-LTLFireability-10
ltl formula formula --ltl=/tmp/999/ltl_10_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.520 real 0.730 user 0.390 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 13 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9531 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~12!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 40
pnml2lts-mc( 0/ 4): unique transitions count: 143
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 48
pnml2lts-mc( 0/ 4): - cum. max stack depth: 48
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 48 states 162 transitions, fanout: 3.375
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4800, Transitions per second: 16200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 37.4 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P2-LTLFireability-11
ltl formula formula --ltl=/tmp/999/ltl_11_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.580 real 0.720 user 0.420 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_11_
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): There are 301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9498 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~8!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 24
pnml2lts-mc( 0/ 4): unique transitions count: 88
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 32
pnml2lts-mc( 0/ 4): - cum. max stack depth: 32
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32 states 107 transitions, fanout: 3.344
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3200, Transitions per second: 10700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 41.1 B/state, compr.: 3.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P2-LTLFireability-12
ltl formula formula --ltl=/tmp/999/ltl_12_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.620 real 0.750 user 0.350 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9494 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 72.0 B/state, compr.: 5.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P2-LTLFireability-13
ltl formula formula --ltl=/tmp/999/ltl_13_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.660 real 0.740 user 0.380 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 300 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9504 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 2
pnml2lts-mc( 0/ 4): unique transitions count: 1
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8 states 8 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 88.0 B/state, compr.: 7.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P2-LTLFireability-14
ltl formula formula --ltl=/tmp/999/ltl_14_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.520 real 0.770 user 0.400 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 300 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9503 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~13!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 39
pnml2lts-mc( 0/ 4): unique transitions count: 128
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 52
pnml2lts-mc( 0/ 4): - cum. max stack depth: 52
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 52 states 157 transitions, fanout: 3.019
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 35.2 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P2-LTLFireability-15
ltl formula formula --ltl=/tmp/999/ltl_15_
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 309 places, 9493 transitions and 184883 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N08P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.610 real 0.730 user 0.360 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 9498 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 2
pnml2lts-mc( 0/ 4): unique transitions count: 1
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8 states 8 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.002 sec on average)
pnml2lts-mc( 0/ 4): States per second: 800, Transitions per second: 800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 88.0 B/state, compr.: 7.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9744 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="ResIsolation-PT-N08P2"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is ResIsolation-PT-N08P2, 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 r631-smll-171774447000012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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