MCC'2022- Execution of r312-tall-165472282500643

About the Execution of ITS-Tools for RERS2020-PT-pb103

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16215.516	795431.00	2252074.00	5625.40	?FFTTFTFTTFFFFTF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282500643.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RERS2020-PT-pb103, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282500643
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 17:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 17:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 7 17:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 7 17:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 7 17:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 18M Jun 6 12:11 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 RERS2020-PT-pb103-LTLCardinality-00
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-01
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-02
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-03
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-04
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-05
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-06
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-07
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-08
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-09
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-10
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-11
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-12
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-13
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-14
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1654909971803

Running Version 202205111006
[2022-06-11 01:12:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 01:12:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 01:12:53] [INFO ] Load time of PNML (sax parser for PT used): 864 ms
[2022-06-11 01:12:53] [INFO ] Transformed 520 places.
[2022-06-11 01:12:54] [INFO ] Transformed 31658 transitions.
[2022-06-11 01:12:54] [INFO ] Found NUPN structural information;
[2022-06-11 01:12:54] [INFO ] Parsed PT model containing 520 places and 31658 transitions in 1108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
FORMULA RERS2020-PT-pb103-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 28429
Applied a total of 7 rules in 118 ms. Remains 513 /520 variables (removed 7) and now considering 28429/28429 (removed 0) transitions.
[2022-06-11 01:12:54] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:12:54] [INFO ] Computed 8 place invariants in 117 ms
[2022-06-11 01:12:55] [INFO ] Implicit Places using invariants in 1166 ms returned []
Implicit Place search using SMT only with invariants took 1194 ms to find 0 implicit places.
[2022-06-11 01:12:55] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:12:55] [INFO ] Computed 8 place invariants in 75 ms
[2022-06-11 01:13:03] [INFO ] Dead Transitions using invariants and state equation in 8023 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 513/520 places, 28429/28429 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/520 places, 28429/28429 transitions.
Support contains 33 out of 513 places after structural reductions.
[2022-06-11 01:13:05] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-06-11 01:13:05] [INFO ] Flatten gal took : 1094 ms
FORMULA RERS2020-PT-pb103-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-11 01:13:06] [INFO ] Flatten gal took : 858 ms
[2022-06-11 01:13:07] [INFO ] Input system was already deterministic with 28429 transitions.
Support contains 29 out of 513 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 772 ms. (steps per millisecond=12 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-06-11 01:13:09] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:13:09] [INFO ] Computed 8 place invariants in 69 ms
[2022-06-11 01:13:09] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-11 01:13:14] [INFO ] After 4607ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:3
[2022-06-11 01:13:14] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2022-06-11 01:13:15] [INFO ] After 1609ms SMT Verify possible using 1379 Read/Feed constraints in real domain returned unsat :2 sat :0 real:4
[2022-06-11 01:13:15] [INFO ] After 6617ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2022-06-11 01:13:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-11 01:13:20] [INFO ] After 4437ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2022-06-11 01:13:27] [INFO ] After 7297ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2022-06-11 01:13:30] [INFO ] Deduced a trap composed of 140 places in 1834 ms of which 5 ms to minimize.
[2022-06-11 01:13:32] [INFO ] Deduced a trap composed of 73 places in 1898 ms of which 2 ms to minimize.
[2022-06-11 01:13:35] [INFO ] Deduced a trap composed of 122 places in 1942 ms of which 1 ms to minimize.
[2022-06-11 01:13:37] [INFO ] Deduced a trap composed of 102 places in 2242 ms of which 2 ms to minimize.
[2022-06-11 01:13:40] [INFO ] Deduced a trap composed of 155 places in 2084 ms of which 4 ms to minimize.
[2022-06-11 01:13:42] [INFO ] Deduced a trap composed of 22 places in 1958 ms of which 1 ms to minimize.
[2022-06-11 01:13:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 01:13:42] [INFO ] After 26696ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 9 out of 513 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 862 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions, in 1 iterations. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2022-06-11 01:13:44] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2022-06-11 01:13:44] [INFO ] Computed 8 place invariants in 55 ms
[2022-06-11 01:13:44] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-11 01:13:48] [INFO ] After 4020ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-06-11 01:13:48] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2022-06-11 01:13:49] [INFO ] After 1157ms SMT Verify possible using 1374 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 01:13:49] [INFO ] After 5603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 01:13:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-11 01:13:53] [INFO ] After 3926ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 01:14:00] [INFO ] After 6135ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 01:14:02] [INFO ] Deduced a trap composed of 11 places in 1775 ms of which 1 ms to minimize.
[2022-06-11 01:14:04] [INFO ] Deduced a trap composed of 51 places in 1832 ms of which 0 ms to minimize.
[2022-06-11 01:14:06] [INFO ] Deduced a trap composed of 19 places in 1704 ms of which 1 ms to minimize.
[2022-06-11 01:14:08] [INFO ] Deduced a trap composed of 49 places in 1655 ms of which 1 ms to minimize.
[2022-06-11 01:14:10] [INFO ] Deduced a trap composed of 101 places in 1322 ms of which 1 ms to minimize.
[2022-06-11 01:14:11] [INFO ] Deduced a trap composed of 72 places in 1071 ms of which 0 ms to minimize.
[2022-06-11 01:14:13] [INFO ] Deduced a trap composed of 92 places in 1451 ms of which 1 ms to minimize.
[2022-06-11 01:14:16] [INFO ] Deduced a trap composed of 84 places in 1822 ms of which 0 ms to minimize.
[2022-06-11 01:14:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 01:14:16] [INFO ] After 26099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 11 ms.
Support contains 7 out of 497 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 104 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 497/497 places, 27456/27456 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2022-06-11 01:14:16] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2022-06-11 01:14:16] [INFO ] Computed 8 place invariants in 46 ms
[2022-06-11 01:14:16] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-11 01:14:20] [INFO ] After 3707ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-11 01:14:20] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2022-06-11 01:14:21] [INFO ] After 1246ms SMT Verify possible using 1374 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 01:14:21] [INFO ] After 5271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 01:14:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-11 01:14:25] [INFO ] After 3707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 01:14:36] [INFO ] After 11197ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 01:14:38] [INFO ] Deduced a trap composed of 72 places in 1266 ms of which 1 ms to minimize.
[2022-06-11 01:14:40] [INFO ] Deduced a trap composed of 92 places in 1346 ms of which 1 ms to minimize.
[2022-06-11 01:14:42] [INFO ] Deduced a trap composed of 164 places in 1593 ms of which 1 ms to minimize.
[2022-06-11 01:14:44] [INFO ] Deduced a trap composed of 185 places in 1790 ms of which 1 ms to minimize.
[2022-06-11 01:14:46] [INFO ] Deduced a trap composed of 19 places in 1750 ms of which 0 ms to minimize.
[2022-06-11 01:14:49] [INFO ] Deduced a trap composed of 12 places in 2093 ms of which 1 ms to minimize.
[2022-06-11 01:14:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 01:14:49] [INFO ] After 27129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 497 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 102 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 497/497 places, 27456/27456 transitions.
FORMULA RERS2020-PT-pb103-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA RERS2020-PT-pb103-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 121 stabilizing places and 10286 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(!(F(p0) U p0)))||G(F(p1)))))'
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 300 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2022-06-11 01:14:49] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2022-06-11 01:14:49] [INFO ] Computed 8 place invariants in 65 ms
[2022-06-11 01:14:50] [INFO ] Implicit Places using invariants in 891 ms returned []
Implicit Place search using SMT only with invariants took 894 ms to find 0 implicit places.
[2022-06-11 01:14:50] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2022-06-11 01:14:50] [INFO ] Computed 8 place invariants in 52 ms
[2022-06-11 01:14:58] [INFO ] Dead Transitions using invariants and state equation in 8076 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions, in 1 iterations. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s503 1), p1:(OR (EQ s435 0) (EQ s350 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1822 ms.
Product exploration explored 100000 steps with 0 reset in 2254 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Detected a total of 118/510 stabilizing places and 10295/28438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-11 01:15:03] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2022-06-11 01:15:03] [INFO ] Computed 8 place invariants in 49 ms
[2022-06-11 01:15:03] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-11 01:15:07] [INFO ] After 3655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:15:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-11 01:15:11] [INFO ] After 3573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:15:11] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2022-06-11 01:15:15] [INFO ] After 3770ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:15:17] [INFO ] Deduced a trap composed of 73 places in 1612 ms of which 1 ms to minimize.
[2022-06-11 01:15:19] [INFO ] Deduced a trap composed of 63 places in 1663 ms of which 1 ms to minimize.
[2022-06-11 01:15:21] [INFO ] Deduced a trap composed of 71 places in 1723 ms of which 1 ms to minimize.
[2022-06-11 01:15:23] [INFO ] Deduced a trap composed of 84 places in 1655 ms of which 0 ms to minimize.
[2022-06-11 01:15:25] [INFO ] Deduced a trap composed of 95 places in 1406 ms of which 0 ms to minimize.
[2022-06-11 01:15:27] [INFO ] Deduced a trap composed of 49 places in 1623 ms of which 0 ms to minimize.
[2022-06-11 01:15:29] [INFO ] Deduced a trap composed of 52 places in 1814 ms of which 0 ms to minimize.
[2022-06-11 01:15:31] [INFO ] Deduced a trap composed of 160 places in 1668 ms of which 0 ms to minimize.
[2022-06-11 01:15:33] [INFO ] Deduced a trap composed of 154 places in 1808 ms of which 1 ms to minimize.
[2022-06-11 01:15:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 01:15:33] [INFO ] After 25984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 510 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 472 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions, in 1 iterations. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39768 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39768 steps, saw 28167 distinct states, run finished after 3004 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 01:15:37] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2022-06-11 01:15:37] [INFO ] Computed 8 place invariants in 54 ms
[2022-06-11 01:15:37] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-11 01:15:40] [INFO ] After 3574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:15:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-11 01:15:44] [INFO ] After 3347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:15:44] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2022-06-11 01:15:49] [INFO ] After 5040ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:15:53] [INFO ] Deduced a trap composed of 51 places in 1575 ms of which 1 ms to minimize.
[2022-06-11 01:15:55] [INFO ] Deduced a trap composed of 60 places in 1529 ms of which 0 ms to minimize.
[2022-06-11 01:15:57] [INFO ] Deduced a trap composed of 120 places in 1505 ms of which 0 ms to minimize.
[2022-06-11 01:15:58] [INFO ] Deduced a trap composed of 92 places in 1173 ms of which 1 ms to minimize.
[2022-06-11 01:16:00] [INFO ] Deduced a trap composed of 72 places in 819 ms of which 1 ms to minimize.
[2022-06-11 01:16:02] [INFO ] Deduced a trap composed of 147 places in 1598 ms of which 4 ms to minimize.
[2022-06-11 01:16:04] [INFO ] Deduced a trap composed of 19 places in 1608 ms of which 1 ms to minimize.
[2022-06-11 01:16:05] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 14349 ms
[2022-06-11 01:16:05] [INFO ] After 21484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-11 01:16:05] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 110 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 110 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2022-06-11 01:16:06] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2022-06-11 01:16:06] [INFO ] Computed 8 place invariants in 49 ms
[2022-06-11 01:16:07] [INFO ] Implicit Places using invariants in 1004 ms returned []
Implicit Place search using SMT only with invariants took 1005 ms to find 0 implicit places.
[2022-06-11 01:16:07] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2022-06-11 01:16:07] [INFO ] Computed 8 place invariants in 52 ms
[2022-06-11 01:16:14] [INFO ] Dead Transitions using invariants and state equation in 7826 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10141 edges and 497 vertex of which 379 / 497 are part of one of the 62 SCC in 4 ms
Free SCC test removed 317 places
Drop transitions removed 10800 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 25026 transitions.
Graph (complete) has 2400 edges and 180 vertex of which 172 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 172 transition count 2416
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 170 transition count 2416
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 168 transition count 2396
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 168 transition count 2396
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 166 transition count 2394
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 59 place count 166 transition count 2361
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 165 transition count 2371
Drop transitions removed 1249 transitions
Redundant transition composition rules discarded 1249 transitions
Iterating global reduction 3 with 1249 rules applied. Total rules applied 1310 place count 165 transition count 1122
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1291 edges and 163 vertex of which 145 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1320 place count 145 transition count 1112
Drop transitions removed 110 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 4 with 111 rules applied. Total rules applied 1431 place count 145 transition count 1001
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1433 place count 143 transition count 991
Iterating global reduction 5 with 2 rules applied. Total rules applied 1435 place count 143 transition count 991
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1436 place count 143 transition count 990
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1438 place count 142 transition count 989
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1443 place count 142 transition count 984
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1455 place count 142 transition count 965
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1472 place count 130 transition count 960
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1473 place count 129 transition count 955
Iterating global reduction 7 with 1 rules applied. Total rules applied 1474 place count 129 transition count 955
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1482 place count 129 transition count 947
Drop transitions removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 8 with 73 rules applied. Total rules applied 1555 place count 129 transition count 874
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1561 place count 129 transition count 868
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1571 place count 123 transition count 864
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1579 place count 123 transition count 856
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1581 place count 123 transition count 854
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1585 place count 121 transition count 852
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1589 place count 121 transition count 848
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1591 place count 121 transition count 846
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1595 place count 119 transition count 844
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 1599 place count 119 transition count 840
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1603 place count 119 transition count 924
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1622 place count 115 transition count 909
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1623 place count 114 transition count 905
Iterating global reduction 12 with 1 rules applied. Total rules applied 1624 place count 114 transition count 905
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1633 place count 114 transition count 896
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1652 place count 114 transition count 877
Applied a total of 1652 rules in 337 ms. Remains 114 /497 variables (removed 383) and now considering 877/27456 (removed 26579) transitions.
Running SMT prover for 1 properties.
[2022-06-11 01:16:15] [INFO ] Flow matrix only has 836 transitions (discarded 41 similar events)
// Phase 1: matrix 836 rows 114 cols
[2022-06-11 01:16:15] [INFO ] Computed 0 place invariants in 7 ms
[2022-06-11 01:16:15] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:16:15] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:16:15] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-11 01:16:15] [INFO ] After 29ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:16:15] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-11 01:16:15] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:16:15] [INFO ] Flatten gal took : 27 ms
[2022-06-11 01:16:15] [INFO ] Flatten gal took : 27 ms
[2022-06-11 01:16:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14410797390220745912.gal : 33 ms
[2022-06-11 01:16:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7338914131244044110.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16508889985877915676;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14410797390220745912.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7338914131244044110.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7338914131244044110.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 21
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :21 after 75
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :75 after 266
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :266 after 1928
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,333684,0.222552,10140,2,862,13,8881,6,0,1331,8932,0
Total reachable state count : 333684

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.223791,10404,2,115,13,8881,7,0,1339,8932,0
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 127 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2022-06-11 01:16:16] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2022-06-11 01:16:16] [INFO ] Computed 8 place invariants in 70 ms
[2022-06-11 01:16:17] [INFO ] Implicit Places using invariants in 839 ms returned []
Implicit Place search using SMT only with invariants took 839 ms to find 0 implicit places.
[2022-06-11 01:16:17] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2022-06-11 01:16:17] [INFO ] Computed 8 place invariants in 55 ms
[2022-06-11 01:16:25] [INFO ] Dead Transitions using invariants and state equation in 8168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 510/510 places, 28438/28438 transitions.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Detected a total of 118/510 stabilizing places and 10295/28438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 219 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-11 01:16:26] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2022-06-11 01:16:26] [INFO ] Computed 8 place invariants in 54 ms
[2022-06-11 01:16:26] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-11 01:16:29] [INFO ] After 3474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:16:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-11 01:16:33] [INFO ] After 3376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:16:33] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2022-06-11 01:16:36] [INFO ] After 3434ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:16:39] [INFO ] Deduced a trap composed of 73 places in 1662 ms of which 1 ms to minimize.
[2022-06-11 01:16:41] [INFO ] Deduced a trap composed of 63 places in 1618 ms of which 1 ms to minimize.
[2022-06-11 01:16:43] [INFO ] Deduced a trap composed of 71 places in 1690 ms of which 3 ms to minimize.
[2022-06-11 01:16:45] [INFO ] Deduced a trap composed of 84 places in 1507 ms of which 1 ms to minimize.
[2022-06-11 01:16:46] [INFO ] Deduced a trap composed of 95 places in 1392 ms of which 1 ms to minimize.
[2022-06-11 01:16:48] [INFO ] Deduced a trap composed of 49 places in 1618 ms of which 0 ms to minimize.
[2022-06-11 01:16:50] [INFO ] Deduced a trap composed of 52 places in 1791 ms of which 1 ms to minimize.
[2022-06-11 01:16:52] [INFO ] Deduced a trap composed of 160 places in 1633 ms of which 1 ms to minimize.
[2022-06-11 01:16:54] [INFO ] Deduced a trap composed of 154 places in 1678 ms of which 0 ms to minimize.
[2022-06-11 01:16:57] [INFO ] Deduced a trap composed of 30 places in 2031 ms of which 1 ms to minimize.
[2022-06-11 01:16:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 01:16:57] [INFO ] After 27058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 510 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 405 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions, in 1 iterations. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40840 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40840 steps, saw 28901 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 01:17:00] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2022-06-11 01:17:00] [INFO ] Computed 8 place invariants in 69 ms
[2022-06-11 01:17:00] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-11 01:17:04] [INFO ] After 3491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:17:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-11 01:17:07] [INFO ] After 3412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:17:07] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2022-06-11 01:17:13] [INFO ] After 5207ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:17:17] [INFO ] Deduced a trap composed of 51 places in 1503 ms of which 0 ms to minimize.
[2022-06-11 01:17:19] [INFO ] Deduced a trap composed of 60 places in 1448 ms of which 0 ms to minimize.
[2022-06-11 01:17:20] [INFO ] Deduced a trap composed of 120 places in 1354 ms of which 5 ms to minimize.
[2022-06-11 01:17:22] [INFO ] Deduced a trap composed of 92 places in 1212 ms of which 2 ms to minimize.
[2022-06-11 01:17:23] [INFO ] Deduced a trap composed of 72 places in 809 ms of which 0 ms to minimize.
[2022-06-11 01:17:25] [INFO ] Deduced a trap composed of 147 places in 1605 ms of which 0 ms to minimize.
[2022-06-11 01:17:28] [INFO ] Deduced a trap composed of 19 places in 1622 ms of which 1 ms to minimize.
[2022-06-11 01:17:29] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 13834 ms
[2022-06-11 01:17:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 01:17:29] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 105 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 121 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2022-06-11 01:17:29] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2022-06-11 01:17:29] [INFO ] Computed 8 place invariants in 51 ms
[2022-06-11 01:17:30] [INFO ] Implicit Places using invariants in 977 ms returned []
Implicit Place search using SMT only with invariants took 977 ms to find 0 implicit places.
[2022-06-11 01:17:30] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2022-06-11 01:17:30] [INFO ] Computed 8 place invariants in 53 ms
[2022-06-11 01:17:38] [INFO ] Dead Transitions using invariants and state equation in 7672 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10141 edges and 497 vertex of which 379 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 317 places
Drop transitions removed 10800 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 25026 transitions.
Graph (complete) has 2400 edges and 180 vertex of which 172 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 172 transition count 2416
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 170 transition count 2416
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 168 transition count 2396
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 168 transition count 2396
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 166 transition count 2394
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 59 place count 166 transition count 2361
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 165 transition count 2371
Drop transitions removed 1249 transitions
Redundant transition composition rules discarded 1249 transitions
Iterating global reduction 3 with 1249 rules applied. Total rules applied 1310 place count 165 transition count 1122
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1291 edges and 163 vertex of which 145 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1320 place count 145 transition count 1112
Drop transitions removed 110 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 4 with 111 rules applied. Total rules applied 1431 place count 145 transition count 1001
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1433 place count 143 transition count 991
Iterating global reduction 5 with 2 rules applied. Total rules applied 1435 place count 143 transition count 991
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1436 place count 143 transition count 990
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1438 place count 142 transition count 989
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1443 place count 142 transition count 984
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1455 place count 142 transition count 965
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1472 place count 130 transition count 960
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1473 place count 129 transition count 955
Iterating global reduction 7 with 1 rules applied. Total rules applied 1474 place count 129 transition count 955
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1482 place count 129 transition count 947
Drop transitions removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 8 with 73 rules applied. Total rules applied 1555 place count 129 transition count 874
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1561 place count 129 transition count 868
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1571 place count 123 transition count 864
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1579 place count 123 transition count 856
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1581 place count 123 transition count 854
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1585 place count 121 transition count 852
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1589 place count 121 transition count 848
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1591 place count 121 transition count 846
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1595 place count 119 transition count 844
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 1599 place count 119 transition count 840
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1603 place count 119 transition count 924
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1622 place count 115 transition count 909
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1623 place count 114 transition count 905
Iterating global reduction 12 with 1 rules applied. Total rules applied 1624 place count 114 transition count 905
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1633 place count 114 transition count 896
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1652 place count 114 transition count 877
Applied a total of 1652 rules in 237 ms. Remains 114 /497 variables (removed 383) and now considering 877/27456 (removed 26579) transitions.
Running SMT prover for 1 properties.
[2022-06-11 01:17:38] [INFO ] Flow matrix only has 836 transitions (discarded 41 similar events)
// Phase 1: matrix 836 rows 114 cols
[2022-06-11 01:17:38] [INFO ] Computed 0 place invariants in 2 ms
[2022-06-11 01:17:38] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 01:17:38] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 01:17:38] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-11 01:17:38] [INFO ] After 28ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:17:38] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-11 01:17:38] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 01:17:38] [INFO ] Flatten gal took : 32 ms
[2022-06-11 01:17:38] [INFO ] Flatten gal took : 27 ms
[2022-06-11 01:17:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17419064394575669099.gal : 5 ms
[2022-06-11 01:17:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17391473988789214089.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15411032273182424231;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17419064394575669099.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17391473988789214089.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17391473988789214089.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 21
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :21 after 75
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :75 after 266
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :266 after 1928
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,333684,0.21093,9896,2,862,13,8923,6,0,1331,8935,0
Total reachable state count : 333684

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,21,0.213168,10336,2,154,13,8923,7,0,1340,8935,0
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 0 reset in 2137 ms.
Product exploration explored 100000 steps with 0 reset in 1991 ms.
Built C files in :
/tmp/ltsmin10644739713523838013
[2022-06-11 01:17:43] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2022-06-11 01:17:44] [INFO ] Built C files in 287ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10644739713523838013
Running compilation step : cd /tmp/ltsmin10644739713523838013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10644739713523838013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10644739713523838013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 106 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2022-06-11 01:17:47] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2022-06-11 01:17:47] [INFO ] Computed 8 place invariants in 54 ms
[2022-06-11 01:17:48] [INFO ] Implicit Places using invariants in 782 ms returned []
Implicit Place search using SMT only with invariants took 799 ms to find 0 implicit places.
[2022-06-11 01:17:48] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2022-06-11 01:17:48] [INFO ] Computed 8 place invariants in 50 ms
[2022-06-11 01:17:56] [INFO ] Dead Transitions using invariants and state equation in 8596 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 510/510 places, 28438/28438 transitions.
Built C files in :
/tmp/ltsmin9664023260739424554
[2022-06-11 01:17:56] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2022-06-11 01:17:56] [INFO ] Built C files in 190ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9664023260739424554
Running compilation step : cd /tmp/ltsmin9664023260739424554;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9664023260739424554;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9664023260739424554;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 01:18:01] [INFO ] Flatten gal took : 1220 ms
[2022-06-11 01:18:03] [INFO ] Flatten gal took : 1195 ms
[2022-06-11 01:18:03] [INFO ] Time to serialize gal into /tmp/LTL14242003273648921726.gal : 131 ms
[2022-06-11 01:18:03] [INFO ] Time to serialize properties into /tmp/LTL10308081640975543647.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14242003273648921726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10308081640975543647.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1424200...268
Read 1 LTL properties
Checking formula 0 : !((F((F(X(!((F("(ps8==1)"))U("(ps8==1)")))))||(G(F("((ps130==0)||(ps101==1))"))))))
Formula 0 simplified : !F(FX!(F"(ps8==1)" U "(ps8==1)") | GF"((ps130==0)||(ps101==1))")
Detected timeout of ITS tools.
[2022-06-11 01:18:19] [INFO ] Flatten gal took : 943 ms
[2022-06-11 01:18:19] [INFO ] Applying decomposition
[2022-06-11 01:18:20] [INFO ] Flatten gal took : 949 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9283005383280110834.txt' '-o' '/tmp/graph9283005383280110834.bin' '-w' '/tmp/graph9283005383280110834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9283005383280110834.bin' '-l' '-1' '-v' '-w' '/tmp/graph9283005383280110834.weights' '-q' '0' '-e' '0.001'
[2022-06-11 01:18:22] [INFO ] Decomposing Gal with order
[2022-06-11 01:18:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 01:18:25] [INFO ] Removed a total of 64224 redundant transitions.
[2022-06-11 01:18:25] [INFO ] Flatten gal took : 2585 ms
[2022-06-11 01:18:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2410 labels/synchronizations in 963 ms.
[2022-06-11 01:18:27] [INFO ] Time to serialize gal into /tmp/LTL1135365362616012878.gal : 64 ms
[2022-06-11 01:18:27] [INFO ] Time to serialize properties into /tmp/LTL17493207045819725995.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1135365362616012878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17493207045819725995.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1135365...246
Read 1 LTL properties
Checking formula 0 : !((F((F(X(!((F("(i7.i0.u101.ps8==1)"))U("(i7.i0.u101.ps8==1)")))))||(G(F("((i5.i2.u79.ps130==0)||(i7.i0.u101.ps101==1))"))))))
Formula 0 simplified : !F(FX!(F"(i7.i0.u101.ps8==1)" U "(i7.i0.u101.ps8==1)") | GF"((i5.i2.u79.ps130==0)||(i7.i0.u101.ps101==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6075145859780081272
[2022-06-11 01:18:43] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6075145859780081272
Running compilation step : cd /tmp/ltsmin6075145859780081272;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6075145859780081272;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6075145859780081272;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property RERS2020-PT-pb103-LTLCardinality-00 finished in 236582 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 89 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2022-06-11 01:18:46] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:18:46] [INFO ] Computed 8 place invariants in 103 ms
[2022-06-11 01:18:47] [INFO ] Implicit Places using invariants in 1094 ms returned []
Implicit Place search using SMT only with invariants took 1096 ms to find 0 implicit places.
[2022-06-11 01:18:47] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:18:47] [INFO ] Computed 8 place invariants in 55 ms
[2022-06-11 01:19:17] [INFO ] Performed 15107/28429 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 01:19:21] [INFO ] Dead Transitions using invariants and state equation in 34121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s373 0) (EQ s271 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 3 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-01 finished in 35657 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(p0)))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 304 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2022-06-11 01:19:22] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2022-06-11 01:19:22] [INFO ] Computed 8 place invariants in 93 ms
[2022-06-11 01:19:22] [INFO ] Implicit Places using invariants in 780 ms returned []
Implicit Place search using SMT only with invariants took 781 ms to find 0 implicit places.
[2022-06-11 01:19:22] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2022-06-11 01:19:22] [INFO ] Computed 8 place invariants in 96 ms
[2022-06-11 01:19:31] [INFO ] Dead Transitions using invariants and state equation in 8619 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions, in 1 iterations. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s124 0) (EQ s191 1) (OR (EQ s183 0) (EQ s262 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 27 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-02 finished in 9868 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 46 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2022-06-11 01:19:31] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:19:31] [INFO ] Computed 8 place invariants in 74 ms
[2022-06-11 01:19:32] [INFO ] Implicit Places using invariants in 848 ms returned []
Implicit Place search using SMT only with invariants took 849 ms to find 0 implicit places.
[2022-06-11 01:19:32] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:19:32] [INFO ] Computed 8 place invariants in 77 ms
[2022-06-11 01:19:41] [INFO ] Dead Transitions using invariants and state equation in 8583 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s73 0) (EQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4019 ms.
Product exploration explored 100000 steps with 33333 reset in 3568 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 49 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RERS2020-PT-pb103-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLCardinality-06 finished in 17419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 27 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 24 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 514 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2022-06-11 01:19:49] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2022-06-11 01:19:49] [INFO ] Computed 8 place invariants in 62 ms
[2022-06-11 01:19:50] [INFO ] Implicit Places using invariants in 906 ms returned []
Implicit Place search using SMT only with invariants took 907 ms to find 0 implicit places.
[2022-06-11 01:19:50] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2022-06-11 01:19:50] [INFO ] Computed 8 place invariants in 62 ms
[2022-06-11 01:19:58] [INFO ] Dead Transitions using invariants and state equation in 8296 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions, in 1 iterations. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s448 0) (EQ s339 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 4 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-07 finished in 9845 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 41 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2022-06-11 01:19:58] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:19:58] [INFO ] Computed 8 place invariants in 61 ms
[2022-06-11 01:19:59] [INFO ] Implicit Places using invariants in 799 ms returned []
Implicit Place search using SMT only with invariants took 799 ms to find 0 implicit places.
[2022-06-11 01:19:59] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:19:59] [INFO ] Computed 8 place invariants in 56 ms
[2022-06-11 01:20:08] [INFO ] Dead Transitions using invariants and state equation in 8340 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s299 0) (EQ s238 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 616 steps with 0 reset in 16 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-11 finished in 9326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 37 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2022-06-11 01:20:08] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:20:08] [INFO ] Computed 8 place invariants in 58 ms
[2022-06-11 01:20:09] [INFO ] Implicit Places using invariants in 835 ms returned []
Implicit Place search using SMT only with invariants took 836 ms to find 0 implicit places.
[2022-06-11 01:20:09] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:20:09] [INFO ] Computed 8 place invariants in 65 ms
[2022-06-11 01:20:17] [INFO ] Dead Transitions using invariants and state equation in 8727 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s229 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 3 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-13 finished in 9728 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((G(p0)||F(p1)))||p2))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 45 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2022-06-11 01:20:17] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:20:18] [INFO ] Computed 8 place invariants in 68 ms
[2022-06-11 01:20:18] [INFO ] Implicit Places using invariants in 872 ms returned []
Implicit Place search using SMT only with invariants took 872 ms to find 0 implicit places.
[2022-06-11 01:20:18] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:20:18] [INFO ] Computed 8 place invariants in 62 ms
[2022-06-11 01:20:27] [INFO ] Dead Transitions using invariants and state equation in 8660 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (OR (EQ s471 0) (EQ s25 1)) (OR (EQ s494 0) (EQ s421 1))), p0:(AND (EQ s25 0) (EQ s471 1)), p1:(AND (EQ s505 0) (EQ s272 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3890 ms.
Product exploration explored 100000 steps with 50000 reset in 3880 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA RERS2020-PT-pb103-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLCardinality-14 finished in 17690 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 38 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2022-06-11 01:20:35] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:20:35] [INFO ] Computed 8 place invariants in 60 ms
[2022-06-11 01:20:36] [INFO ] Implicit Places using invariants in 804 ms returned []
Implicit Place search using SMT only with invariants took 804 ms to find 0 implicit places.
[2022-06-11 01:20:36] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2022-06-11 01:20:36] [INFO ] Computed 8 place invariants in 60 ms
[2022-06-11 01:20:44] [INFO ] Dead Transitions using invariants and state equation in 8321 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s414 0) (NEQ s252 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-15 finished in 9287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(!(F(p0) U p0)))||G(F(p1)))))'
[2022-06-11 01:20:45] [INFO ] Flatten gal took : 826 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8853926573455939200
[2022-06-11 01:20:46] [INFO ] Too many transitions (28429) to apply POR reductions. Disabling POR matrices.
[2022-06-11 01:20:46] [INFO ] Built C files in 215ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8853926573455939200
Running compilation step : cd /tmp/ltsmin8853926573455939200;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 01:20:47] [INFO ] Applying decomposition
[2022-06-11 01:20:48] [INFO ] Flatten gal took : 1088 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6952497081800047999.txt' '-o' '/tmp/graph6952497081800047999.bin' '-w' '/tmp/graph6952497081800047999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6952497081800047999.bin' '-l' '-1' '-v' '-w' '/tmp/graph6952497081800047999.weights' '-q' '0' '-e' '0.001'
[2022-06-11 01:20:51] [INFO ] Decomposing Gal with order
[2022-06-11 01:20:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 01:20:54] [INFO ] Removed a total of 64220 redundant transitions.
[2022-06-11 01:20:54] [INFO ] Flatten gal took : 2333 ms
[2022-06-11 01:20:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 2050 labels/synchronizations in 863 ms.
[2022-06-11 01:20:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality14278319310438010381.gal : 55 ms
[2022-06-11 01:20:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality13382755129485551214.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14278319310438010381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13382755129485551214.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...269
Read 1 LTL properties
Checking formula 0 : !((F((F(X(!((F("(i6.u93.ps8==1)"))U("(i6.u93.ps8==1)")))))||(G(F("((i3.i0.u79.ps130==0)||(i6.u93.ps101==1))"))))))
Formula 0 simplified : !F(FX!(F"(i6.u93.ps8==1)" U "(i6.u93.ps8==1)") | GF"((i3.i0.u79.ps130==0)||(i6.u93.ps101==1))")

BK_STOP 1654910767234

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="RERS2020-PT-pb103"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is RERS2020-PT-pb103, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472282500643"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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