MCC'2022- Execution of r222-tall-165286025900850

About the Execution of ITS-Tools for ShieldRVs-PT-050A

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16219.439	3600000.00	2831035.00	461609.10	?????????TT?????	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.r222-tall-165286025900850.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 ShieldRVs-PT-050A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025900850
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.1K Apr 30 07:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 07:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 06:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 06:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 320K May 10 09:34 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 ShieldRVs-PT-050A-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1653063428601

Running Version 202205111006
[2022-05-20 16:17:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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-05-20 16:17:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 16:17:09] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2022-05-20 16:17:09] [INFO ] Transformed 703 places.
[2022-05-20 16:17:09] [INFO ] Transformed 953 transitions.
[2022-05-20 16:17:09] [INFO ] Found NUPN structural information;
[2022-05-20 16:17:09] [INFO ] Parsed PT model containing 703 places and 953 transitions in 256 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 234 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 55 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:17:10] [INFO ] Computed 201 place invariants in 28 ms
[2022-05-20 16:17:10] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:17:10] [INFO ] Computed 201 place invariants in 7 ms
[2022-05-20 16:17:11] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:17:11] [INFO ] Computed 201 place invariants in 6 ms
[2022-05-20 16:17:11] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
Support contains 234 out of 703 places after structural reductions.
[2022-05-20 16:17:12] [INFO ] Flatten gal took : 161 ms
[2022-05-20 16:17:12] [INFO ] Flatten gal took : 91 ms
[2022-05-20 16:17:12] [INFO ] Input system was already deterministic with 953 transitions.
Support contains 233 out of 703 places (down from 234) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 100) seen :87
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) 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 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:17:13] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:17:14] [INFO ] [Real]Absence check using 201 positive place invariants in 71 ms returned sat
[2022-05-20 16:17:14] [INFO ] After 549ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 16:17:14] [INFO ] [Nat]Absence check using 201 positive place invariants in 35 ms returned sat
[2022-05-20 16:17:15] [INFO ] After 1017ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-20 16:17:15] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 4 ms to minimize.
[2022-05-20 16:17:16] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2022-05-20 16:17:16] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2022-05-20 16:17:16] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2022-05-20 16:17:16] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:17:16] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:17:16] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:17:16] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:17:16] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2022-05-20 16:17:17] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:17:17] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:17:17] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2022-05-20 16:17:17] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2022-05-20 16:17:17] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2022-05-20 16:17:17] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1668 ms
[2022-05-20 16:17:17] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:17:18] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 1 ms to minimize.
[2022-05-20 16:17:18] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:17:18] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:17:18] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:17:18] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:17:19] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:17:19] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:17:19] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:17:19] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:17:19] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:17:19] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:17:20] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:17:20] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:17:20] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:17:20] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:17:20] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:17:21] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:17:21] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:17:21] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:17:21] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2022-05-20 16:17:21] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:17:21] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:17:22] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:17:22] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:17:22] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:17:22] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:17:22] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:17:23] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:17:23] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:17:23] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:17:23] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:17:23] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:17:24] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:17:24] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:17:24] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:17:24] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:17:24] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:17:24] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:17:25] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:17:25] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:17:25] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:17:25] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:17:25] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:17:26] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:17:26] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:17:26] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:17:26] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:17:26] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:17:27] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:17:27] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:17:27] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:17:27] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:17:27] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:17:28] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:17:28] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:17:28] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:17:28] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:17:28] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:17:29] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:17:29] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:17:29] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:17:29] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:17:29] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:17:30] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:17:30] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:17:30] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:17:30] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:17:30] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:17:30] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:17:31] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:17:31] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:17:31] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:17:31] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:17:31] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:17:32] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:17:32] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:17:32] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:17:32] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:17:32] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:17:33] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:17:33] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:17:33] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:17:33] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:17:33] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:17:33] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:17:34] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:17:34] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:17:34] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:17:34] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:17:34] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:17:35] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:17:35] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:17:35] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:17:35] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2022-05-20 16:17:35] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2022-05-20 16:17:35] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2022-05-20 16:17:35] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2022-05-20 16:17:35] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2022-05-20 16:17:36] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2022-05-20 16:17:36] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:17:36] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:17:36] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2022-05-20 16:17:36] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2022-05-20 16:17:36] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:17:37] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:17:37] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2022-05-20 16:17:37] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2022-05-20 16:17:37] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:17:37] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2022-05-20 16:17:37] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:17:37] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2022-05-20 16:17:37] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:17:38] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2022-05-20 16:17:38] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2022-05-20 16:17:38] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2022-05-20 16:17:38] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:17:38] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:17:38] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:17:38] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2022-05-20 16:17:39] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2022-05-20 16:17:39] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2022-05-20 16:17:39] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:17:39] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:17:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 16:17:39] [INFO ] After 25078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 528 ms.
Support contains 42 out of 703 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 703/703 places, 953/953 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 0 with 97 rules applied. Total rules applied 99 place count 702 transition count 952
Applied a total of 99 rules in 144 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/703 places, 952/953 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) 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 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:17:40] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:17:40] [INFO ] [Real]Absence check using 201 positive place invariants in 32 ms returned sat
[2022-05-20 16:17:40] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 16:17:41] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 16:17:41] [INFO ] After 762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 16:17:42] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:17:42] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:17:42] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:17:42] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:17:42] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:17:43] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:17:43] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:17:43] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:17:43] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:17:43] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:17:44] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:17:44] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:17:44] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:17:44] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:17:44] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:17:44] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:17:45] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:17:45] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:17:45] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:17:45] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:17:45] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:17:46] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:17:46] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:17:46] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:17:46] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:17:46] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:17:46] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:17:47] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:17:47] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:17:47] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:17:47] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:17:47] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:17:47] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2022-05-20 16:17:48] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:17:48] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:17:48] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:17:48] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:17:48] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:17:48] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:17:48] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2022-05-20 16:17:48] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:17:49] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:17:49] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:17:49] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:17:49] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:17:49] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2022-05-20 16:17:49] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2022-05-20 16:17:49] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2022-05-20 16:17:49] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 7690 ms
[2022-05-20 16:17:49] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:17:50] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:17:50] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-05-20 16:17:50] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2022-05-20 16:17:50] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2022-05-20 16:17:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 488 ms
[2022-05-20 16:17:50] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:17:50] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:17:50] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:17:51] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:17:51] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:17:51] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:17:51] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:17:51] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:17:52] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:17:52] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:17:52] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:17:52] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:17:52] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:17:52] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:17:53] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:17:53] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:17:53] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:17:53] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:17:53] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:17:53] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:17:54] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:17:54] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:17:54] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:17:54] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:17:54] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:17:55] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:17:55] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:17:55] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:17:55] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:17:55] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:17:55] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:17:56] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:17:56] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:17:56] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:17:56] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:17:56] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:17:56] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2022-05-20 16:17:56] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2022-05-20 16:17:57] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2022-05-20 16:17:57] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2022-05-20 16:17:57] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:17:57] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:17:57] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:17:57] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2022-05-20 16:17:57] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:17:57] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2022-05-20 16:17:58] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2022-05-20 16:17:58] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2022-05-20 16:17:58] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 0 ms to minimize.
[2022-05-20 16:17:58] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:17:58] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2022-05-20 16:17:58] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2022-05-20 16:17:58] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2022-05-20 16:17:58] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2022-05-20 16:17:58] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2022-05-20 16:17:58] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2022-05-20 16:17:58] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2022-05-20 16:17:59] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2022-05-20 16:17:59] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 8723 ms
[2022-05-20 16:17:59] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:17:59] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:18:00] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:18:00] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:18:00] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:18:00] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:18:00] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2022-05-20 16:18:01] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:18:01] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:18:01] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:18:01] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:18:01] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:18:01] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:18:02] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:18:02] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:18:02] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:18:02] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:18:02] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:18:03] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:18:03] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:18:03] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:18:03] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:18:03] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:18:03] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:18:04] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:18:04] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:18:04] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:18:04] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:18:04] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:18:04] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:18:05] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:18:05] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:18:05] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:18:05] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:18:05] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:18:05] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:18:06] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 1 ms to minimize.
[2022-05-20 16:18:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 16:18:06] [INFO ] After 25330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 223 ms.
Support contains 30 out of 702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 70 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 131480 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131480 steps, saw 77058 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:18:10] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:18:10] [INFO ] [Real]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 16:18:10] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 16:18:10] [INFO ] [Nat]Absence check using 201 positive place invariants in 39 ms returned sat
[2022-05-20 16:18:11] [INFO ] After 711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 16:18:11] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:18:11] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:18:11] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:18:12] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:18:12] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:18:12] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:18:12] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:18:12] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:18:13] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:18:13] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:18:13] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:18:13] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:18:13] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:18:13] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:18:14] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:18:14] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:18:14] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:18:14] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:18:14] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:18:14] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:18:15] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:18:15] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:18:15] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:18:15] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:18:15] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2022-05-20 16:18:15] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2022-05-20 16:18:15] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2022-05-20 16:18:16] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2022-05-20 16:18:16] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:18:16] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:18:16] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2022-05-20 16:18:16] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:18:16] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2022-05-20 16:18:16] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:18:16] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:18:17] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:18:17] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2022-05-20 16:18:17] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2022-05-20 16:18:17] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2022-05-20 16:18:17] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2022-05-20 16:18:17] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2022-05-20 16:18:17] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2022-05-20 16:18:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2022-05-20 16:18:17] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2022-05-20 16:18:17] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2022-05-20 16:18:17] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2022-05-20 16:18:17] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2022-05-20 16:18:18] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:18:18] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:18:18] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:18:18] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2022-05-20 16:18:18] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:18:18] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:18:18] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:18:18] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:18:19] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:18:19] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2022-05-20 16:18:19] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2022-05-20 16:18:19] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2022-05-20 16:18:19] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2022-05-20 16:18:19] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 8006 ms
[2022-05-20 16:18:19] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2022-05-20 16:18:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-20 16:18:19] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:18:19] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:18:19] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:18:19] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:18:20] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:18:20] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2022-05-20 16:18:20] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2022-05-20 16:18:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 678 ms
[2022-05-20 16:18:20] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:18:20] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:18:20] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:18:21] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:18:21] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:18:21] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:18:21] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:18:21] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:18:21] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:18:22] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:18:22] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:18:22] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:18:22] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:18:22] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:18:22] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:18:23] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:18:23] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:18:23] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:18:23] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:18:23] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:18:24] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:18:24] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:18:24] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:18:24] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:18:24] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:18:24] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:18:25] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:18:25] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:18:25] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:18:25] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:18:25] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:18:26] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:18:26] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:18:26] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:18:26] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:18:26] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:18:26] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:18:26] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:18:27] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:18:27] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:18:27] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2022-05-20 16:18:27] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:18:27] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:18:27] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:18:27] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:18:28] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2022-05-20 16:18:28] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2022-05-20 16:18:28] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2022-05-20 16:18:28] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:18:28] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:18:28] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:18:28] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2022-05-20 16:18:29] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:18:29] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2022-05-20 16:18:29] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:18:29] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:18:29] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2022-05-20 16:18:29] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:18:29] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:18:29] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:18:29] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:18:30] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:18:30] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:18:30] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:18:31] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:18:31] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:18:31] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:18:31] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:18:32] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:18:32] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:18:32] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:18:32] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:18:32] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:18:33] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:18:33] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:18:33] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:18:33] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:18:33] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:18:33] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:18:34] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:18:34] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:18:34] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:18:34] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:18:34] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:18:34] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:18:35] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:18:35] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:18:35] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:18:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 16:18:35] [INFO ] After 25110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 163 ms.
Support contains 30 out of 702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 31 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 26 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:18:35] [INFO ] Computed 201 place invariants in 6 ms
[2022-05-20 16:18:36] [INFO ] Implicit Places using invariants in 346 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:18:36] [INFO ] Computed 201 place invariants in 11 ms
[2022-05-20 16:18:36] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2022-05-20 16:18:37] [INFO ] Redundant transitions in 124 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:18:37] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:18:37] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 24 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:18:37] [INFO ] Computed 201 place invariants in 6 ms
[2022-05-20 16:18:37] [INFO ] [Real]Absence check using 201 positive place invariants in 30 ms returned sat
[2022-05-20 16:18:37] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 16:18:37] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2022-05-20 16:18:38] [INFO ] After 741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 16:18:38] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:18:39] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:18:39] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:18:39] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:18:39] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:18:39] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:18:40] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:18:40] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:18:40] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:18:40] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:18:40] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:18:41] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:18:41] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:18:41] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:18:41] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:18:41] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:18:41] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:18:42] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:18:42] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:18:42] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:18:42] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:18:42] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:18:42] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:18:43] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:18:43] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:18:43] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2022-05-20 16:18:43] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:18:43] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2022-05-20 16:18:43] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2022-05-20 16:18:43] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 0 ms to minimize.
[2022-05-20 16:18:44] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2022-05-20 16:18:44] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2022-05-20 16:18:44] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:18:44] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:18:44] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:18:44] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:18:44] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2022-05-20 16:18:44] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:18:44] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2022-05-20 16:18:45] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2022-05-20 16:18:45] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2022-05-20 16:18:45] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2022-05-20 16:18:45] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2022-05-20 16:18:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2022-05-20 16:18:45] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2022-05-20 16:18:45] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2022-05-20 16:18:45] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2022-05-20 16:18:45] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:18:45] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:18:45] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:18:46] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:18:46] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:18:46] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:18:46] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:18:46] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:18:46] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-05-20 16:18:46] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2022-05-20 16:18:46] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2022-05-20 16:18:46] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2022-05-20 16:18:46] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2022-05-20 16:18:46] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 8148 ms
[2022-05-20 16:18:47] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2022-05-20 16:18:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2022-05-20 16:18:47] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:18:47] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:18:47] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:18:47] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:18:47] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:18:47] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2022-05-20 16:18:47] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2022-05-20 16:18:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 683 ms
[2022-05-20 16:18:48] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:18:48] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 3 ms to minimize.
[2022-05-20 16:18:48] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:18:48] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:18:48] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:18:49] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:18:49] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:18:49] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:18:49] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:18:49] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:18:49] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:18:50] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:18:50] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:18:50] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:18:50] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:18:50] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:18:50] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:18:51] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:18:51] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:18:51] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:18:51] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:18:51] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:18:52] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:18:52] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:18:52] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:18:52] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:18:52] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:18:52] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:18:53] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:18:53] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:18:53] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:18:53] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:18:53] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:18:53] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:18:54] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:18:54] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:18:54] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:18:54] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:18:54] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:18:54] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:18:54] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:18:55] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2022-05-20 16:18:55] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2022-05-20 16:18:55] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:18:55] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:18:55] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:18:55] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2022-05-20 16:18:55] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:18:56] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:18:56] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:18:56] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:18:56] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:18:56] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:18:56] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:18:56] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:18:56] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:18:56] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:18:57] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:18:57] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:18:57] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:18:57] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:18:57] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:18:58] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:18:58] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:18:58] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:18:58] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:18:59] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:18:59] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:18:59] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:18:59] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:18:59] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:19:00] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:19:00] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:19:00] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:19:00] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:19:00] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:19:00] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:19:01] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:19:01] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:19:01] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:19:01] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:19:01] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:19:02] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:19:02] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:19:02] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:19:02] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:19:02] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:19:02] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:19:03] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:19:03] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:19:03] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:19:03] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:19:03] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:19:03] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:19:04] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:19:04] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:19:04] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:19:04] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:19:04] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:19:04] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:19:04] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:19:05] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:19:05] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:19:05] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:19:05] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:19:05] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:19:05] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:19:06] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2022-05-20 16:19:06] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:19:06] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:19:06] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:19:06] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:19:06] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:19:07] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:19:07] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:19:07] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:19:07] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:19:07] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:19:08] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:19:08] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:19:08] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:19:08] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:19:08] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:19:08] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:19:09] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:19:09] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:19:09] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:19:09] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:19:09] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:19:10] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:19:10] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:19:10] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:19:10] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:19:10] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:19:10] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:19:11] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:19:11] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:19:11] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:19:11] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:19:11] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:19:12] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:19:12] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:19:12] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:19:12] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:19:12] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:19:12] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:19:13] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:19:13] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:19:13] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:19:14] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:19:14] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:19:14] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:19:14] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 1 ms to minimize.
[2022-05-20 16:19:14] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:19:15] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:19:15] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:19:15] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:19:15] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:19:16] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:19:16] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:19:16] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:19:16] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:19:16] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:19:17] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:19:17] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:19:17] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:19:17] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:19:17] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:19:18] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:19:18] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:19:18] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:19:18] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:19:18] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:19:19] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:19:19] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:19:19] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:19:19] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:19:19] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 1 ms to minimize.
[2022-05-20 16:19:20] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:19:20] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:19:20] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:19:20] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:19:20] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:19:21] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:19:21] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:19:21] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:19:21] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:19:21] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:19:22] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:19:22] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:19:22] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:19:22] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:19:22] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:19:23] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:19:23] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:19:23] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:19:23] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:19:23] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:19:24] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:19:24] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:19:24] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:19:24] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:19:24] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:19:25] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:19:25] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:19:25] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:19:25] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:19:25] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:19:26] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:19:26] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:19:26] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:19:26] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:19:26] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:19:27] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:19:27] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:19:27] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:19:27] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:19:27] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:19:27] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:19:28] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:19:28] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:19:28] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:19:28] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2022-05-20 16:19:28] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:19:28] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2022-05-20 16:19:29] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:19:29] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:19:29] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:19:29] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:19:29] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:19:29] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:19:29] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:19:29] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:19:30] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:19:30] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:19:30] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2022-05-20 16:19:30] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:19:30] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:19:30] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:19:30] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:19:31] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:19:31] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:19:31] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:19:31] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:19:31] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:19:31] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:19:31] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2022-05-20 16:19:32] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2022-05-20 16:19:32] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2022-05-20 16:19:32] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2022-05-20 16:19:32] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:19:32] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:19:32] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:19:32] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2022-05-20 16:19:33] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:19:33] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:19:33] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:19:33] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:19:33] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:19:33] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2022-05-20 16:19:33] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:19:34] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:19:34] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:19:34] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:19:34] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:19:34] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:19:34] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:19:34] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2022-05-20 16:19:34] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:19:35] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:19:35] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:19:35] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:19:35] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2022-05-20 16:19:35] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:19:35] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:19:35] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:19:36] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2022-05-20 16:19:36] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:19:36] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:19:36] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:19:36] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:19:36] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:19:36] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:19:37] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:19:37] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:19:37] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2022-05-20 16:19:37] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:19:37] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:19:37] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2022-05-20 16:19:37] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:19:38] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:19:38] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:19:38] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:19:38] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2022-05-20 16:19:38] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:19:38] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:19:38] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2022-05-20 16:19:38] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 0 ms to minimize.
[2022-05-20 16:19:39] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:19:39] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:19:39] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:19:39] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2022-05-20 16:19:39] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:19:39] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2022-05-20 16:19:39] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:19:40] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
[2022-05-20 16:19:40] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2022-05-20 16:19:40] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2022-05-20 16:19:40] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:19:40] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:19:40] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:19:40] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2022-05-20 16:19:41] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:19:41] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:19:41] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:19:41] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:19:41] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:19:41] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:19:42] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:19:42] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:19:42] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:19:42] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:19:42] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:19:42] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:19:43] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:19:43] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:19:43] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:19:43] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2022-05-20 16:19:43] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:19:43] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:19:44] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:19:44] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:19:44] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:19:44] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:19:44] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:19:45] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:19:45] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:19:45] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:19:45] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:19:45] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:19:45] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:19:45] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:19:45] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:19:46] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:19:46] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:19:46] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:19:46] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:19:46] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:19:46] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:19:46] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:19:46] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:19:47] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:19:47] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:19:47] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:19:47] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-20 16:19:47] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:19:47] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:19:47] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:19:47] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:19:48] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:19:48] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:19:48] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:19:48] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:19:48] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:19:48] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:19:48] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2022-05-20 16:19:48] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:19:49] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:19:49] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:19:49] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:19:49] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:19:49] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:19:49] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:19:49] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:19:49] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2022-05-20 16:19:50] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:19:50] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:19:50] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 5 ms to minimize.
[2022-05-20 16:19:50] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:19:50] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:19:50] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:19:50] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:19:50] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:19:51] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:19:51] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:19:51] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:19:51] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:19:51] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:19:51] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:19:51] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:19:51] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:19:52] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:19:52] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:19:52] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:19:52] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:19:52] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:19:52] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:19:52] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:19:52] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:19:53] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:19:53] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:19:53] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:19:53] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:19:53] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:19:53] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:19:53] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:19:53] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:19:53] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:19:54] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:19:54] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:19:54] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:19:54] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:19:54] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:19:54] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:19:54] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:19:54] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:19:55] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:19:55] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:19:55] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:19:55] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:19:55] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:19:55] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:19:55] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2022-05-20 16:19:56] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:19:56] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:19:56] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:19:56] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:19:56] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:19:56] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2022-05-20 16:19:56] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:19:56] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:19:57] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:19:57] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:19:57] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:19:57] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:19:57] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:19:57] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:19:57] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:19:57] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:19:58] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:19:58] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2022-05-20 16:19:58] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:19:58] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2022-05-20 16:19:58] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:19:58] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:19:58] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:19:59] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:19:59] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:19:59] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:19:59] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:19:59] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2022-05-20 16:19:59] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:19:59] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:19:59] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:00] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:00] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:00] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:00] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:00] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:00] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:00] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:20:00] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:01] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:01] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2022-05-20 16:20:01] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2022-05-20 16:20:01] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:01] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:01] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:20:01] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:01] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:20:02] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2022-05-20 16:20:02] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:02] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:20:02] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:20:02] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:20:02] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:02] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:02] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:03] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:03] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:03] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:03] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:03] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:03] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:20:03] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2022-05-20 16:20:03] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:04] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:20:04] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:04] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:20:04] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:20:04] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:04] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:04] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:04] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:04] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:05] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:05] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:05] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:05] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:05] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:05] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:20:05] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:05] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:06] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:06] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:06] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:06] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:20:06] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:20:06] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:20:06] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:20:06] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:07] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:20:07] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:07] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:20:07] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:20:07] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:07] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:07] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:07] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:20:08] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:20:08] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:20:08] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:20:08] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:20:08] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:08] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2022-05-20 16:20:08] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:08] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2022-05-20 16:20:09] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:20:09] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:20:09] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:20:09] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:09] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:09] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:09] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:20:09] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:20:09] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-05-20 16:20:10] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:20:10] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:10] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:10] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:10] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2022-05-20 16:20:10] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:10] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:11] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2022-05-20 16:20:11] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2022-05-20 16:20:11] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2022-05-20 16:20:11] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:11] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:20:11] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:20:11] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:11] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:12] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:20:12] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:12] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:20:12] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2022-05-20 16:20:12] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2022-05-20 16:20:12] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:12] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:20:12] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:20:12] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:20:13] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:13] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2022-05-20 16:20:13] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:20:13] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:20:13] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:13] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:13] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:13] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:14] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:20:14] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:20:14] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:20:14] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:20:14] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:20:14] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:14] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:14] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2022-05-20 16:20:15] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:15] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:15] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2022-05-20 16:20:15] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 0 ms to minimize.
[2022-05-20 16:20:15] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:15] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:20:15] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:15] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:20:16] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:16] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:20:16] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:20:16] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:16] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 0 ms to minimize.
[2022-05-20 16:20:16] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2022-05-20 16:20:16] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 0 ms to minimize.
[2022-05-20 16:20:16] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:20:17] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2022-05-20 16:20:17] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:17] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:17] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:17] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:17] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:20:17] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:17] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:20:18] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:18] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2022-05-20 16:20:18] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:20:18] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:18] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:18] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:20:18] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:20:18] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:20:19] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:20:19] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:19] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:19] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:19] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:19] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:19] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:20:19] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:20] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:20] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:20] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:20] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:20] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:20] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:20] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:20] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:20:21] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:21] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:20:21] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:20:21] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:21] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:21] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:21] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:20:21] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:22] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:22] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:22] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:22] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:20:22] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:20:22] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:22] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:20:22] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:23] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:23] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:23] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:23] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:23] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:23] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:23] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:20:23] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:24] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:24] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:24] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:24] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:24] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:24] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:20:24] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:20:24] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:25] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:25] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:25] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:25] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:25] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:25] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:25] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:20:25] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:26] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:26] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:26] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:26] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:26] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:26] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:26] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:20:26] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:20:27] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:20:27] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:27] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:27] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:27] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:20:27] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:27] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:27] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:28] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:20:28] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:20:28] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:20:28] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:28] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:28] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:28] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:20:28] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:20:29] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:29] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:29] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:20:29] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:29] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:29] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:29] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:29] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:30] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:20:30] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:20:30] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:20:30] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:20:30] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:30] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:30] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:30] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:31] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:31] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:31] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:31] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:20:31] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:20:31] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:20:31] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:32] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:20:32] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:32] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:32] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:32] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:20:32] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:32] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:20:32] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:33] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:33] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:20:33] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:20:33] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:20:33] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:20:33] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:20:33] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:33] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:34] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:20:34] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:20:34] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:34] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:20:34] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:20:34] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:34] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:20:34] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:35] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:20:35] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:35] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:20:35] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:20:35] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:35] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:20:35] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:35] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:36] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:20:36] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:20:36] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:20:36] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:36] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:36] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:36] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:36] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:20:37] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:20:37] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:37] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:37] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:37] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:20:37] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:37] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:38] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:38] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:20:38] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:38] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:20:38] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:38] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:38] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:38] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:39] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:20:39] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:39] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:39] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:39] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:20:39] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:39] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:39] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:20:40] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:20:40] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:20:40] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:40] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:40] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 0 ms to minimize.
[2022-05-20 16:20:40] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:20:40] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:40] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:41] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:41] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:41] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2022-05-20 16:20:41] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:20:41] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:41] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:20:41] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:41] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:42] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:20:42] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:42] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:20:42] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:20:42] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:20:42] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:42] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2022-05-20 16:20:43] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:43] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:43] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:43] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:20:43] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:20:43] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:43] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:43] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:20:44] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:44] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:20:44] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:44] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:44] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:20:44] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:44] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:20:45] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:45] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:20:45] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:45] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:45] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:45] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:20:45] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:20:45] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:46] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:20:46] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:20:46] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:46] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:46] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:46] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:20:46] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2022-05-20 16:20:46] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:47] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:47] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:47] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:47] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:20:47] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:20:47] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:20:47] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:48] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:48] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:20:48] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:48] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:48] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2022-05-20 16:20:48] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:48] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:48] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-05-20 16:20:49] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:20:49] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2022-05-20 16:20:49] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:49] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:20:49] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:49] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:20:49] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:20:50] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:20:50] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:20:50] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:50] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:20:50] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:20:50] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:50] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:50] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:20:51] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:20:51] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:20:51] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:51] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:20:51] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:20:51] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2022-05-20 16:20:51] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 0 ms to minimize.
[2022-05-20 16:20:52] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:20:52] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:20:52] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:20:53] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:20:53] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:20:53] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:20:53] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:20:53] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:20:53] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:20:54] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:20:54] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:20:54] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:20:54] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:20:55] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:20:55] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:20:55] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:20:55] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:20:56] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:20:56] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:20:56] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:20:56] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:20:56] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:20:57] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:20:57] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:20:57] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:20:57] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:20:57] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2022-05-20 16:20:57] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:20:58] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:20:58] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2022-05-20 16:20:58] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:20:58] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:20:58] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:20:58] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:20:58] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2022-05-20 16:20:59] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2022-05-20 16:20:59] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:20:59] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:20:59] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:20:59] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2022-05-20 16:20:59] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:21:00] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:21:00] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:21:00] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2022-05-20 16:21:00] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:21:00] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:21:00] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:21:01] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:21:01] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:21:01] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:21:01] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:21:01] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:21:01] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:21:02] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2022-05-20 16:21:02] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:21:02] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:21:02] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2022-05-20 16:21:02] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2022-05-20 16:21:02] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:21:02] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:21:03] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:21:03] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2022-05-20 16:21:03] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2022-05-20 16:21:03] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:21:03] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:21:03] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:21:03] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:21:04] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:21:04] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:21:04] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:21:04] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:21:04] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:21:04] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:21:04] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:21:04] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:21:05] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:21:05] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:21:05] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:21:05] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:21:05] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:21:05] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:21:05] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:21:05] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:21:06] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2022-05-20 16:21:06] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:21:06] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:21:06] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2022-05-20 16:21:06] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:21:06] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:21:06] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:21:07] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:21:07] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:21:07] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:21:07] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:21:07] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:21:07] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:21:07] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:21:07] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:21:08] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:21:08] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:21:08] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:21:08] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:21:08] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:21:08] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:21:08] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:21:09] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:21:09] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:21:09] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:21:09] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2022-05-20 16:21:09] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:21:09] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2022-05-20 16:21:09] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2022-05-20 16:21:10] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:21:10] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:21:10] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-05-20 16:21:10] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2022-05-20 16:21:10] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2022-05-20 16:21:10] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:21:10] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:21:11] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:21:11] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2022-05-20 16:21:11] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:21:11] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:21:11] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2022-05-20 16:21:11] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:21:12] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2022-05-20 16:21:12] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:21:12] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:21:12] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:21:12] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:21:12] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:21:12] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:21:13] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:21:13] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:21:13] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:21:13] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:21:13] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:21:14] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:21:14] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2022-05-20 16:21:14] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:21:14] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:21:14] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:21:15] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:21:15] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:21:15] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:21:15] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:21:15] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:21:16] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:21:16] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:21:16] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:21:16] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:21:16] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:21:17] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:21:17] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:21:17] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:21:17] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:21:17] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:21:17] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2022-05-20 16:21:18] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:21:18] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:21:18] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:21:18] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2022-05-20 16:21:19] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 1 ms to minimize.
[2022-05-20 16:21:19] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:21:19] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 0 ms to minimize.
[2022-05-20 16:21:19] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:21:20] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:21:20] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:21:20] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:21:20] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 1 ms to minimize.
[2022-05-20 16:21:21] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:21:21] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:21:21] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:21:21] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:21:22] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 0 ms to minimize.
[2022-05-20 16:21:22] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:21:22] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:21:22] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:21:23] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:21:23] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:21:23] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:21:23] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:21:23] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2022-05-20 16:21:23] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2022-05-20 16:21:23] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:21:24] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2022-05-20 16:21:24] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2022-05-20 16:21:24] [INFO ] Trap strengthening (SAT) tested/added 1053/1052 trap constraints in 156429 ms
[2022-05-20 16:21:25] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:21:25] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2022-05-20 16:21:25] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:21:25] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:21:25] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:21:25] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:21:25] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:21:26] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:21:26] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:21:26] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2022-05-20 16:21:26] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:21:27] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2022-05-20 16:21:27] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:21:27] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:21:27] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:21:27] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:21:27] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:21:27] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:21:28] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:21:28] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:21:28] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2022-05-20 16:21:28] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2022-05-20 16:21:28] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2022-05-20 16:21:28] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2022-05-20 16:21:29] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2022-05-20 16:21:29] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:21:29] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2022-05-20 16:21:29] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2022-05-20 16:21:29] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:21:29] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:21:30] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:21:30] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:21:30] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:21:30] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:21:30] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:21:30] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:21:30] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:21:30] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:21:31] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:21:31] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:21:31] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:21:31] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:21:31] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:21:31] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:21:31] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:21:32] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:21:32] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:21:32] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:21:32] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:21:32] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:21:32] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:21:32] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:21:33] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:21:33] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:21:33] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:21:33] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:21:33] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:21:33] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:21:33] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:21:34] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:21:34] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:21:34] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:21:34] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:21:35] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:21:35] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:21:35] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:21:35] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:21:35] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:21:36] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:21:36] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:21:36] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:21:36] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:21:36] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:21:37] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:21:37] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:21:37] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:21:37] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:21:37] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:21:38] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:21:38] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:21:38] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:21:38] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:21:38] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:21:39] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:21:39] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:21:39] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:21:39] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:21:39] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:21:40] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:21:40] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:21:40] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:21:40] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:21:40] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:21:41] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:21:41] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:21:41] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2022-05-20 16:21:41] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:21:41] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:21:41] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:21:42] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:21:42] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:21:42] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2022-05-20 16:21:42] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:21:42] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:21:43] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:21:43] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:21:43] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:21:43] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:21:43] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:21:44] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:21:44] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:21:44] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:21:44] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:21:44] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:21:45] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:21:45] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:21:45] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:21:45] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:21:45] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:21:46] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:21:46] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:21:46] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 4 ms to minimize.
[2022-05-20 16:21:46] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:21:46] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:21:47] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:21:47] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:21:47] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:21:47] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:21:47] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:21:48] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:21:48] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:21:48] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:21:48] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:21:48] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:21:49] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:21:49] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:21:49] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:21:49] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:21:49] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:21:49] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:21:49] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:21:50] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:21:50] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:21:50] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:21:50] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:21:50] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:21:50] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:21:50] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2022-05-20 16:21:50] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:21:51] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:21:51] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:21:51] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:21:51] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:21:51] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:21:51] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:21:51] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:21:52] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:21:52] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:21:52] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:21:52] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:21:52] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:21:52] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:21:52] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:21:52] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:21:53] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:21:53] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:21:53] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:21:53] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:21:53] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:21:53] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:21:53] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2022-05-20 16:21:54] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:21:54] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2022-05-20 16:21:54] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2022-05-20 16:21:54] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:21:54] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:21:54] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2022-05-20 16:21:54] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:21:55] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:21:55] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:21:55] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:21:55] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2022-05-20 16:21:55] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2022-05-20 16:21:55] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2022-05-20 16:21:55] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2022-05-20 16:21:55] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:21:56] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:21:56] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:21:56] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2022-05-20 16:21:56] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:21:56] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:21:56] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:21:56] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:21:57] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2022-05-20 16:21:57] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:21:57] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2022-05-20 16:21:57] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:21:57] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:21:57] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2022-05-20 16:21:57] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:21:57] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:21:58] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:21:58] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:21:58] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:21:58] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:21:58] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2022-05-20 16:21:58] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:21:58] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:21:59] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2022-05-20 16:21:59] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:21:59] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:21:59] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:21:59] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:21:59] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:21:59] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:00] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:22:00] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:22:00] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2022-05-20 16:22:00] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:22:00] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:00] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:22:00] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:22:01] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:22:01] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:01] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:22:01] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:22:01] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:22:01] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:22:01] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:22:01] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:22:02] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:22:02] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:22:02] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:22:02] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:22:02] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:22:02] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:22:02] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:22:03] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:22:03] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:22:03] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:22:03] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:22:03] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:22:03] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:22:03] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:22:04] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:22:04] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:22:04] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:22:04] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:04] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:04] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:04] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:22:05] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:22:05] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:22:05] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:22:05] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:22:05] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:22:05] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:22:05] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:22:06] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:22:06] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:06] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:22:06] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:22:06] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:22:06] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:22:06] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:22:06] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:07] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:22:07] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:07] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:22:07] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:22:07] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:22:07] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:22:07] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:22:08] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2022-05-20 16:22:08] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:22:08] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:22:08] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:22:08] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:22:08] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:22:08] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:22:09] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:22:09] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2022-05-20 16:22:09] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:22:09] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2022-05-20 16:22:09] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:22:09] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:22:09] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:22:10] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:22:10] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:22:10] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:22:10] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:22:10] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:22:10] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:22:10] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:22:10] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:22:11] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:22:11] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:22:11] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:22:11] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2022-05-20 16:22:11] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2022-05-20 16:22:11] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:22:11] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:22:12] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:22:12] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2022-05-20 16:22:12] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:12] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:12] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:22:12] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:22:12] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:22:13] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:22:13] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:13] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:22:13] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2022-05-20 16:22:13] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:13] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:22:13] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:22:13] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:14] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:22:14] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:22:14] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:22:14] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:22:14] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:14] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:22:14] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:22:15] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2022-05-20 16:22:15] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:22:15] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2022-05-20 16:22:15] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:22:15] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:22:15] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:22:15] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2022-05-20 16:22:16] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:22:16] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2022-05-20 16:22:16] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:22:16] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:22:16] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2022-05-20 16:22:16] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2022-05-20 16:22:16] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:22:16] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:22:17] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2022-05-20 16:22:17] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2022-05-20 16:22:17] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2022-05-20 16:22:17] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2022-05-20 16:22:17] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2022-05-20 16:22:17] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:22:17] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:22:18] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2022-05-20 16:22:18] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2022-05-20 16:22:18] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2022-05-20 16:22:18] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2022-05-20 16:22:18] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:22:18] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:22:18] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:22:19] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:22:19] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:22:19] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2022-05-20 16:22:19] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:22:20] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:22:20] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:22:20] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:22:20] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:22:20] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:22:20] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2022-05-20 16:22:20] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:22:21] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:22:21] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:22:21] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:22:21] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-05-20 16:22:21] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:22:22] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:22:22] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2022-05-20 16:22:22] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:22:22] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:22:22] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:22:22] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:22:22] [INFO ] Trap strengthening (SAT) tested/added 375/375 trap constraints in 57931 ms
[2022-05-20 16:22:22] [INFO ] After 224773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-20 16:22:22] [INFO ] After 225013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-20 16:22:22] [INFO ] Flatten gal took : 58 ms
[2022-05-20 16:22:22] [INFO ] Flatten gal took : 56 ms
[2022-05-20 16:22:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16880701715656131543.gal : 33 ms
[2022-05-20 16:22:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6794845109471902331.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3576074745558881665;'/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/ReachabilityCardinality16880701715656131543.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6794845109471902331.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/ReachabilityCardinality6794845109471902331.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :69 after 140
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :140 after 1696
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1696 after 33195
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :33195 after 308872
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :308872 after 3.70348e+06
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :3.70348e+06 after 3.36166e+08
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :3.36166e+08 after 4.8429e+10
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :4.8429e+10 after 2.22404e+13
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :2.22404e+13 after 2.18047e+16
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :2.18047e+16 after 8.46253e+20
Detected timeout of ITS tools.
[2022-05-20 16:22:38] [INFO ] Flatten gal took : 50 ms
[2022-05-20 16:22:38] [INFO ] Applying decomposition
[2022-05-20 16:22:38] [INFO ] Flatten gal took : 46 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/graph11035425691806656830.txt' '-o' '/tmp/graph11035425691806656830.bin' '-w' '/tmp/graph11035425691806656830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11035425691806656830.bin' '-l' '-1' '-v' '-w' '/tmp/graph11035425691806656830.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:22:38] [INFO ] Decomposing Gal with order
[2022-05-20 16:22:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:22:38] [INFO ] Removed a total of 1091 redundant transitions.
[2022-05-20 16:22:38] [INFO ] Flatten gal took : 134 ms
[2022-05-20 16:22:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 1064 labels/synchronizations in 74 ms.
[2022-05-20 16:22:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13257196546189413738.gal : 16 ms
[2022-05-20 16:22:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11967045961789555010.prop : 63 ms
Invoking ITS tools like this :cd /tmp/redAtoms3576074745558881665;'/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/ReachabilityCardinality13257196546189413738.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11967045961789555010.prop' '--nowitness'

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...300
Loading property file /tmp/ReachabilityCardinality11967045961789555010.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :8 after 8
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :8 after 8
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :8 after 8
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :8 after 8
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :8 after 7.6313e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14374781072129180600
[2022-05-20 16:22:53] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14374781072129180600
Running compilation step : cd /tmp/ltsmin14374781072129180600;'/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'
Compilation finished in 1768 ms.
Running link step : cd /tmp/ltsmin14374781072129180600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14374781072129180600;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp36==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 16:23:08] [INFO ] Flatten gal took : 42 ms
[2022-05-20 16:23:08] [INFO ] Flatten gal took : 43 ms
[2022-05-20 16:23:09] [INFO ] Input system was already deterministic with 953 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 703/703 places, 953/953 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 54 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:23:09] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:23:09] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:23:09] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:23:10] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
[2022-05-20 16:23:10] [INFO ] Redundant transitions in 138 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2022-05-20 16:23:10] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:23:10] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 27 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 702/703 places, 951/953 transitions.
[2022-05-20 16:23:10] [INFO ] Flatten gal took : 39 ms
[2022-05-20 16:23:10] [INFO ] Flatten gal took : 40 ms
[2022-05-20 16:23:10] [INFO ] Input system was already deterministic with 951 transitions.
[2022-05-20 16:23:11] [INFO ] Flatten gal took : 39 ms
[2022-05-20 16:23:11] [INFO ] Flatten gal took : 40 ms
[2022-05-20 16:23:11] [INFO ] Time to serialize gal into /tmp/CTLFireability17846676836126659901.gal : 6 ms
[2022-05-20 16:23:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8731376290648941429.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17846676836126659901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8731376290648941429.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:23:41] [INFO ] Flatten gal took : 41 ms
[2022-05-20 16:23:41] [INFO ] Applying decomposition
[2022-05-20 16:23:41] [INFO ] Flatten gal took : 41 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/graph17821540370180173849.txt' '-o' '/tmp/graph17821540370180173849.bin' '-w' '/tmp/graph17821540370180173849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17821540370180173849.bin' '-l' '-1' '-v' '-w' '/tmp/graph17821540370180173849.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:23:41] [INFO ] Decomposing Gal with order
[2022-05-20 16:23:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:23:41] [INFO ] Removed a total of 1045 redundant transitions.
[2022-05-20 16:23:41] [INFO ] Flatten gal took : 107 ms
[2022-05-20 16:23:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 988 labels/synchronizations in 58 ms.
[2022-05-20 16:23:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15377762394140177597.gal : 7 ms
[2022-05-20 16:23:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3232136010503608442.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15377762394140177597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3232136010503608442.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 703/703 places, 953/953 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 701 transition count 951
Applied a total of 2 rules in 45 ms. Remains 701 /703 variables (removed 2) and now considering 951/953 (removed 2) transitions.
// Phase 1: matrix 951 rows 701 cols
[2022-05-20 16:24:11] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:24:12] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 951 rows 701 cols
[2022-05-20 16:24:12] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:24:12] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
[2022-05-20 16:24:12] [INFO ] Redundant transitions in 185 ms returned [299]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 950 rows 701 cols
[2022-05-20 16:24:12] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:24:13] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 701/703 places, 950/953 transitions.
Applied a total of 0 rules in 47 ms. Remains 701 /701 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 701/703 places, 950/953 transitions.
[2022-05-20 16:24:13] [INFO ] Flatten gal took : 34 ms
[2022-05-20 16:24:13] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:24:13] [INFO ] Input system was already deterministic with 950 transitions.
[2022-05-20 16:24:13] [INFO ] Flatten gal took : 35 ms
[2022-05-20 16:24:13] [INFO ] Flatten gal took : 34 ms
[2022-05-20 16:24:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8552626066342199733.gal : 4 ms
[2022-05-20 16:24:13] [INFO ] Time to serialize properties into /tmp/CTLFireability12707094232401256240.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8552626066342199733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12707094232401256240.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:24:43] [INFO ] Flatten gal took : 36 ms
[2022-05-20 16:24:43] [INFO ] Applying decomposition
[2022-05-20 16:24:43] [INFO ] Flatten gal took : 35 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/graph11254395796115588674.txt' '-o' '/tmp/graph11254395796115588674.bin' '-w' '/tmp/graph11254395796115588674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11254395796115588674.bin' '-l' '-1' '-v' '-w' '/tmp/graph11254395796115588674.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:24:44] [INFO ] Decomposing Gal with order
[2022-05-20 16:24:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:24:44] [INFO ] Removed a total of 1045 redundant transitions.
[2022-05-20 16:24:44] [INFO ] Flatten gal took : 57 ms
[2022-05-20 16:24:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 948 labels/synchronizations in 13 ms.
[2022-05-20 16:24:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8778697529176729425.gal : 5 ms
[2022-05-20 16:24:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15880499360512095200.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8778697529176729425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15880499360512095200.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 19 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:25:14] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:25:14] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:25:14] [INFO ] Computed 201 place invariants in 13 ms
[2022-05-20 16:25:15] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:25:15] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:25:15] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
[2022-05-20 16:25:15] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:25:15] [INFO ] Flatten gal took : 39 ms
[2022-05-20 16:25:16] [INFO ] Input system was already deterministic with 953 transitions.
[2022-05-20 16:25:16] [INFO ] Flatten gal took : 39 ms
[2022-05-20 16:25:16] [INFO ] Flatten gal took : 39 ms
[2022-05-20 16:25:16] [INFO ] Time to serialize gal into /tmp/CTLFireability8968309535468085799.gal : 4 ms
[2022-05-20 16:25:16] [INFO ] Time to serialize properties into /tmp/CTLFireability18262931774735561507.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8968309535468085799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18262931774735561507.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:25:46] [INFO ] Flatten gal took : 61 ms
[2022-05-20 16:25:46] [INFO ] Applying decomposition
[2022-05-20 16:25:46] [INFO ] Flatten gal took : 61 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/graph11699037693588560676.txt' '-o' '/tmp/graph11699037693588560676.bin' '-w' '/tmp/graph11699037693588560676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11699037693588560676.bin' '-l' '-1' '-v' '-w' '/tmp/graph11699037693588560676.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:25:46] [INFO ] Decomposing Gal with order
[2022-05-20 16:25:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:25:46] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 16:25:46] [INFO ] Flatten gal took : 58 ms
[2022-05-20 16:25:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 896 labels/synchronizations in 32 ms.
[2022-05-20 16:25:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1461846982048236676.gal : 14 ms
[2022-05-20 16:25:46] [INFO ] Time to serialize properties into /tmp/CTLFireability5741877834127377494.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1461846982048236676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5741877834127377494.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 10 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:26:16] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:26:16] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:26:16] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:26:17] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:26:17] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:26:18] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
[2022-05-20 16:26:18] [INFO ] Flatten gal took : 50 ms
[2022-05-20 16:26:18] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:26:18] [INFO ] Input system was already deterministic with 953 transitions.
[2022-05-20 16:26:18] [INFO ] Flatten gal took : 38 ms
[2022-05-20 16:26:18] [INFO ] Flatten gal took : 78 ms
[2022-05-20 16:26:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15899386871171303525.gal : 6 ms
[2022-05-20 16:26:18] [INFO ] Time to serialize properties into /tmp/CTLFireability15399113279739923654.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15899386871171303525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15399113279739923654.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:26:48] [INFO ] Flatten gal took : 38 ms
[2022-05-20 16:26:48] [INFO ] Applying decomposition
[2022-05-20 16:26:48] [INFO ] Flatten gal took : 38 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/graph11555915966091046169.txt' '-o' '/tmp/graph11555915966091046169.bin' '-w' '/tmp/graph11555915966091046169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11555915966091046169.bin' '-l' '-1' '-v' '-w' '/tmp/graph11555915966091046169.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:26:48] [INFO ] Decomposing Gal with order
[2022-05-20 16:26:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:26:48] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 16:26:48] [INFO ] Flatten gal took : 54 ms
[2022-05-20 16:26:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 864 labels/synchronizations in 60 ms.
[2022-05-20 16:26:48] [INFO ] Time to serialize gal into /tmp/CTLFireability12443151927503553789.gal : 5 ms
[2022-05-20 16:26:48] [INFO ] Time to serialize properties into /tmp/CTLFireability10312237124541117069.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12443151927503553789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10312237124541117069.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 17 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:27:19] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:27:19] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:27:19] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:27:20] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:27:20] [INFO ] Computed 201 place invariants in 7 ms
[2022-05-20 16:27:20] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
[2022-05-20 16:27:20] [INFO ] Flatten gal took : 49 ms
[2022-05-20 16:27:20] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:27:20] [INFO ] Input system was already deterministic with 953 transitions.
[2022-05-20 16:27:20] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:27:20] [INFO ] Flatten gal took : 36 ms
[2022-05-20 16:27:20] [INFO ] Time to serialize gal into /tmp/CTLFireability5108438525344375904.gal : 15 ms
[2022-05-20 16:27:20] [INFO ] Time to serialize properties into /tmp/CTLFireability11680007223028392434.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5108438525344375904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11680007223028392434.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:27:50] [INFO ] Flatten gal took : 38 ms
[2022-05-20 16:27:50] [INFO ] Applying decomposition
[2022-05-20 16:27:50] [INFO ] Flatten gal took : 36 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/graph408354958763557439.txt' '-o' '/tmp/graph408354958763557439.bin' '-w' '/tmp/graph408354958763557439.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph408354958763557439.bin' '-l' '-1' '-v' '-w' '/tmp/graph408354958763557439.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:27:51] [INFO ] Decomposing Gal with order
[2022-05-20 16:27:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:27:51] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 16:27:51] [INFO ] Flatten gal took : 54 ms
[2022-05-20 16:27:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 960 labels/synchronizations in 59 ms.
[2022-05-20 16:27:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16492942732136268201.gal : 21 ms
[2022-05-20 16:27:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15577193398440974333.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16492942732136268201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15577193398440974333.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 703/703 places, 953/953 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 44 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:28:21] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:28:21] [INFO ] Implicit Places using invariants in 379 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:28:21] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:28:22] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
[2022-05-20 16:28:23] [INFO ] Redundant transitions in 643 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2022-05-20 16:28:23] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:28:23] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 22 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 702/703 places, 951/953 transitions.
[2022-05-20 16:28:23] [INFO ] Flatten gal took : 35 ms
[2022-05-20 16:28:23] [INFO ] Flatten gal took : 52 ms
[2022-05-20 16:28:23] [INFO ] Input system was already deterministic with 951 transitions.
[2022-05-20 16:28:23] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:28:23] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:28:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13860703286096399404.gal : 3 ms
[2022-05-20 16:28:23] [INFO ] Time to serialize properties into /tmp/CTLFireability960522865890816332.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13860703286096399404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability960522865890816332.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:28:53] [INFO ] Flatten gal took : 39 ms
[2022-05-20 16:28:53] [INFO ] Applying decomposition
[2022-05-20 16:28:54] [INFO ] Flatten gal took : 43 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/graph2391301943233063251.txt' '-o' '/tmp/graph2391301943233063251.bin' '-w' '/tmp/graph2391301943233063251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2391301943233063251.bin' '-l' '-1' '-v' '-w' '/tmp/graph2391301943233063251.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:28:54] [INFO ] Decomposing Gal with order
[2022-05-20 16:28:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:28:54] [INFO ] Removed a total of 1045 redundant transitions.
[2022-05-20 16:28:54] [INFO ] Flatten gal took : 50 ms
[2022-05-20 16:28:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 892 labels/synchronizations in 27 ms.
[2022-05-20 16:28:54] [INFO ] Time to serialize gal into /tmp/CTLFireability319661764848438722.gal : 18 ms
[2022-05-20 16:28:54] [INFO ] Time to serialize properties into /tmp/CTLFireability3330220480462015151.ctl : 2 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability319661764848438722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3330220480462015151.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...252
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 43 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:29:24] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:29:24] [INFO ] Implicit Places using invariants in 411 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:29:24] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:29:25] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2022-05-20 16:29:25] [INFO ] Redundant transitions in 136 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2022-05-20 16:29:25] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:29:26] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 18 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 702/703 places, 951/953 transitions.
[2022-05-20 16:29:26] [INFO ] Flatten gal took : 35 ms
[2022-05-20 16:29:26] [INFO ] Flatten gal took : 38 ms
[2022-05-20 16:29:26] [INFO ] Input system was already deterministic with 951 transitions.
[2022-05-20 16:29:26] [INFO ] Flatten gal took : 46 ms
[2022-05-20 16:29:26] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:29:26] [INFO ] Time to serialize gal into /tmp/CTLFireability15855020602506465134.gal : 3 ms
[2022-05-20 16:29:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3376478347695097432.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15855020602506465134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3376478347695097432.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:29:56] [INFO ] Flatten gal took : 38 ms
[2022-05-20 16:29:56] [INFO ] Applying decomposition
[2022-05-20 16:29:56] [INFO ] Flatten gal took : 37 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/graph1391080381111067053.txt' '-o' '/tmp/graph1391080381111067053.bin' '-w' '/tmp/graph1391080381111067053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1391080381111067053.bin' '-l' '-1' '-v' '-w' '/tmp/graph1391080381111067053.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:29:56] [INFO ] Decomposing Gal with order
[2022-05-20 16:29:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:29:56] [INFO ] Removed a total of 1045 redundant transitions.
[2022-05-20 16:29:56] [INFO ] Flatten gal took : 49 ms
[2022-05-20 16:29:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 820 labels/synchronizations in 41 ms.
[2022-05-20 16:29:56] [INFO ] Time to serialize gal into /tmp/CTLFireability12649282168515238064.gal : 4 ms
[2022-05-20 16:29:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13232219091115524349.ctl : 293 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12649282168515238064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13232219091115524349.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 71 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:30:27] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:30:27] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:30:27] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:30:28] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
[2022-05-20 16:30:28] [INFO ] Redundant transitions in 139 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2022-05-20 16:30:28] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:28] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 23 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 702/703 places, 951/953 transitions.
[2022-05-20 16:30:28] [INFO ] Flatten gal took : 52 ms
[2022-05-20 16:30:28] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:30:29] [INFO ] Input system was already deterministic with 951 transitions.
[2022-05-20 16:30:29] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:30:29] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:30:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3235985770402501260.gal : 4 ms
[2022-05-20 16:30:29] [INFO ] Time to serialize properties into /tmp/CTLFireability3682193819809816022.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3235985770402501260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3682193819809816022.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:30:59] [INFO ] Flatten gal took : 36 ms
[2022-05-20 16:30:59] [INFO ] Applying decomposition
[2022-05-20 16:30:59] [INFO ] Flatten gal took : 35 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/graph5959615915806070802.txt' '-o' '/tmp/graph5959615915806070802.bin' '-w' '/tmp/graph5959615915806070802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5959615915806070802.bin' '-l' '-1' '-v' '-w' '/tmp/graph5959615915806070802.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:30:59] [INFO ] Decomposing Gal with order
[2022-05-20 16:30:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:30:59] [INFO ] Removed a total of 1045 redundant transitions.
[2022-05-20 16:30:59] [INFO ] Flatten gal took : 48 ms
[2022-05-20 16:30:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 956 labels/synchronizations in 29 ms.
[2022-05-20 16:30:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11356920443371114582.gal : 7 ms
[2022-05-20 16:30:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16112947461593875450.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11356920443371114582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16112947461593875450.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 10 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:31:29] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:31:29] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:31:29] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:31:30] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:31:30] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:31:31] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
[2022-05-20 16:31:31] [INFO ] Flatten gal took : 35 ms
[2022-05-20 16:31:31] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:31:31] [INFO ] Input system was already deterministic with 953 transitions.
[2022-05-20 16:31:31] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:31:31] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:31:31] [INFO ] Time to serialize gal into /tmp/CTLFireability16845488338813859029.gal : 3 ms
[2022-05-20 16:31:31] [INFO ] Time to serialize properties into /tmp/CTLFireability12141242728101976590.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16845488338813859029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12141242728101976590.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:32:01] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:32:01] [INFO ] Applying decomposition
[2022-05-20 16:32:01] [INFO ] Flatten gal took : 43 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/graph4519535783327125791.txt' '-o' '/tmp/graph4519535783327125791.bin' '-w' '/tmp/graph4519535783327125791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4519535783327125791.bin' '-l' '-1' '-v' '-w' '/tmp/graph4519535783327125791.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:32:01] [INFO ] Decomposing Gal with order
[2022-05-20 16:32:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:32:01] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 16:32:01] [INFO ] Flatten gal took : 48 ms
[2022-05-20 16:32:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 816 labels/synchronizations in 27 ms.
[2022-05-20 16:32:01] [INFO ] Time to serialize gal into /tmp/CTLFireability7086911988502299453.gal : 5 ms
[2022-05-20 16:32:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3943642693320301101.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7086911988502299453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3943642693320301101.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 703/703 places, 953/953 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 43 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:32:31] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:32:31] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:32:31] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:32:32] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
[2022-05-20 16:32:32] [INFO ] Redundant transitions in 135 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2022-05-20 16:32:32] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:32:33] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 17 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 702/703 places, 951/953 transitions.
[2022-05-20 16:32:33] [INFO ] Flatten gal took : 35 ms
[2022-05-20 16:32:33] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:32:33] [INFO ] Input system was already deterministic with 951 transitions.
Finished random walk after 184 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=23 )
FORMULA ShieldRVs-PT-050A-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 703/703 places, 953/953 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 701 transition count 951
Applied a total of 2 rules in 29 ms. Remains 701 /703 variables (removed 2) and now considering 951/953 (removed 2) transitions.
// Phase 1: matrix 951 rows 701 cols
[2022-05-20 16:32:33] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:32:33] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 951 rows 701 cols
[2022-05-20 16:32:33] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:32:34] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
[2022-05-20 16:32:34] [INFO ] Redundant transitions in 156 ms returned [299]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 950 rows 701 cols
[2022-05-20 16:32:34] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:32:35] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 701/703 places, 950/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 701 /701 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 701/703 places, 950/953 transitions.
[2022-05-20 16:32:35] [INFO ] Flatten gal took : 31 ms
[2022-05-20 16:32:35] [INFO ] Flatten gal took : 33 ms
[2022-05-20 16:32:35] [INFO ] Input system was already deterministic with 950 transitions.
Finished random walk after 1278 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=182 )
FORMULA ShieldRVs-PT-050A-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:32:35] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:32:35] [INFO ] Implicit Places using invariants in 347 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:32:35] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:32:36] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
[2022-05-20 16:32:36] [INFO ] Redundant transitions in 135 ms returned [303]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:32:36] [INFO ] Computed 201 place invariants in 15 ms
[2022-05-20 16:32:37] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 703/703 places, 952/953 transitions.
Applied a total of 0 rules in 30 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 703/703 places, 952/953 transitions.
[2022-05-20 16:32:37] [INFO ] Flatten gal took : 35 ms
[2022-05-20 16:32:37] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:32:37] [INFO ] Input system was already deterministic with 952 transitions.
[2022-05-20 16:32:37] [INFO ] Flatten gal took : 36 ms
[2022-05-20 16:32:37] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:32:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14403282844443627129.gal : 4 ms
[2022-05-20 16:32:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2508407028958452469.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14403282844443627129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2508407028958452469.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:33:07] [INFO ] Flatten gal took : 36 ms
[2022-05-20 16:33:07] [INFO ] Applying decomposition
[2022-05-20 16:33:07] [INFO ] Flatten gal took : 37 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/graph9009825398812474138.txt' '-o' '/tmp/graph9009825398812474138.bin' '-w' '/tmp/graph9009825398812474138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9009825398812474138.bin' '-l' '-1' '-v' '-w' '/tmp/graph9009825398812474138.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:33:07] [INFO ] Decomposing Gal with order
[2022-05-20 16:33:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:33:07] [INFO ] Removed a total of 1045 redundant transitions.
[2022-05-20 16:33:07] [INFO ] Flatten gal took : 49 ms
[2022-05-20 16:33:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 860 labels/synchronizations in 29 ms.
[2022-05-20 16:33:07] [INFO ] Time to serialize gal into /tmp/CTLFireability9495744404818784312.gal : 3 ms
[2022-05-20 16:33:07] [INFO ] Time to serialize properties into /tmp/CTLFireability13415275110874038281.ctl : 19 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9495744404818784312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13415275110874038281.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 10 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:33:37] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:33:38] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:33:38] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:33:38] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:33:38] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:33:39] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
[2022-05-20 16:33:39] [INFO ] Flatten gal took : 38 ms
[2022-05-20 16:33:39] [INFO ] Flatten gal took : 48 ms
[2022-05-20 16:33:39] [INFO ] Input system was already deterministic with 953 transitions.
[2022-05-20 16:33:39] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:33:39] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:33:39] [INFO ] Time to serialize gal into /tmp/CTLFireability11448990013191789977.gal : 6 ms
[2022-05-20 16:33:39] [INFO ] Time to serialize properties into /tmp/CTLFireability11612434850239102292.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11448990013191789977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11612434850239102292.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:34:09] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:34:09] [INFO ] Applying decomposition
[2022-05-20 16:34:09] [INFO ] Flatten gal took : 37 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/graph11175684121150890885.txt' '-o' '/tmp/graph11175684121150890885.bin' '-w' '/tmp/graph11175684121150890885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11175684121150890885.bin' '-l' '-1' '-v' '-w' '/tmp/graph11175684121150890885.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:34:09] [INFO ] Decomposing Gal with order
[2022-05-20 16:34:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:34:09] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 16:34:09] [INFO ] Flatten gal took : 49 ms
[2022-05-20 16:34:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 952 labels/synchronizations in 24 ms.
[2022-05-20 16:34:09] [INFO ] Time to serialize gal into /tmp/CTLFireability16680398398702674695.gal : 5 ms
[2022-05-20 16:34:09] [INFO ] Time to serialize properties into /tmp/CTLFireability3221470126961071376.ctl : 2 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16680398398702674695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3221470126961071376.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:34:39] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:34:40] [INFO ] Implicit Places using invariants in 318 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:34:40] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:34:41] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:34:41] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:34:41] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
[2022-05-20 16:34:41] [INFO ] Flatten gal took : 35 ms
[2022-05-20 16:34:41] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:34:41] [INFO ] Input system was already deterministic with 953 transitions.
[2022-05-20 16:34:41] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:34:41] [INFO ] Flatten gal took : 36 ms
[2022-05-20 16:34:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3943076801800958544.gal : 3 ms
[2022-05-20 16:34:41] [INFO ] Time to serialize properties into /tmp/CTLFireability593538410705496658.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3943076801800958544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability593538410705496658.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:35:11] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:35:11] [INFO ] Applying decomposition
[2022-05-20 16:35:11] [INFO ] Flatten gal took : 37 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/graph17114161406717895648.txt' '-o' '/tmp/graph17114161406717895648.bin' '-w' '/tmp/graph17114161406717895648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17114161406717895648.bin' '-l' '-1' '-v' '-w' '/tmp/graph17114161406717895648.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:35:12] [INFO ] Decomposing Gal with order
[2022-05-20 16:35:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:35:12] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 16:35:12] [INFO ] Flatten gal took : 54 ms
[2022-05-20 16:35:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 768 labels/synchronizations in 38 ms.
[2022-05-20 16:35:12] [INFO ] Time to serialize gal into /tmp/CTLFireability171314434208154591.gal : 4 ms
[2022-05-20 16:35:12] [INFO ] Time to serialize properties into /tmp/CTLFireability11300150237826617119.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability171314434208154591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11300150237826617119.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 14 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:35:42] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:35:42] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:35:42] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:35:43] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:35:43] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:35:43] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
[2022-05-20 16:35:43] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:35:43] [INFO ] Flatten gal took : 39 ms
[2022-05-20 16:35:43] [INFO ] Input system was already deterministic with 953 transitions.
[2022-05-20 16:35:44] [INFO ] Flatten gal took : 39 ms
[2022-05-20 16:35:44] [INFO ] Flatten gal took : 39 ms
[2022-05-20 16:35:44] [INFO ] Time to serialize gal into /tmp/CTLFireability774635175297721673.gal : 8 ms
[2022-05-20 16:35:44] [INFO ] Time to serialize properties into /tmp/CTLFireability3796899692154329073.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability774635175297721673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3796899692154329073.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:36:14] [INFO ] Flatten gal took : 40 ms
[2022-05-20 16:36:14] [INFO ] Applying decomposition
[2022-05-20 16:36:14] [INFO ] Flatten gal took : 39 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/graph11269006481271244384.txt' '-o' '/tmp/graph11269006481271244384.bin' '-w' '/tmp/graph11269006481271244384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11269006481271244384.bin' '-l' '-1' '-v' '-w' '/tmp/graph11269006481271244384.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:36:14] [INFO ] Decomposing Gal with order
[2022-05-20 16:36:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:36:14] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 16:36:14] [INFO ] Flatten gal took : 53 ms
[2022-05-20 16:36:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 872 labels/synchronizations in 26 ms.
[2022-05-20 16:36:14] [INFO ] Time to serialize gal into /tmp/CTLFireability18109161461016491514.gal : 5 ms
[2022-05-20 16:36:14] [INFO ] Time to serialize properties into /tmp/CTLFireability17758075740462937225.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18109161461016491514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17758075740462937225.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:36:44] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:36:44] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:36:44] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:36:45] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:36:45] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:36:45] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
[2022-05-20 16:36:46] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:36:46] [INFO ] Flatten gal took : 39 ms
[2022-05-20 16:36:46] [INFO ] Input system was already deterministic with 953 transitions.
[2022-05-20 16:36:46] [INFO ] Flatten gal took : 38 ms
[2022-05-20 16:36:46] [INFO ] Flatten gal took : 38 ms
[2022-05-20 16:36:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11932720309098686167.gal : 3 ms
[2022-05-20 16:36:46] [INFO ] Time to serialize properties into /tmp/CTLFireability13169261015741684172.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11932720309098686167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13169261015741684172.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:37:16] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:37:16] [INFO ] Applying decomposition
[2022-05-20 16:37:16] [INFO ] Flatten gal took : 37 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/graph4913378108843773171.txt' '-o' '/tmp/graph4913378108843773171.bin' '-w' '/tmp/graph4913378108843773171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4913378108843773171.bin' '-l' '-1' '-v' '-w' '/tmp/graph4913378108843773171.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:37:16] [INFO ] Decomposing Gal with order
[2022-05-20 16:37:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:37:16] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 16:37:16] [INFO ] Flatten gal took : 48 ms
[2022-05-20 16:37:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 824 labels/synchronizations in 32 ms.
[2022-05-20 16:37:16] [INFO ] Time to serialize gal into /tmp/CTLFireability15930082847198470492.gal : 3 ms
[2022-05-20 16:37:16] [INFO ] Time to serialize properties into /tmp/CTLFireability4922919588479967307.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15930082847198470492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4922919588479967307.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 16:37:46] [INFO ] Flatten gal took : 43 ms
[2022-05-20 16:37:46] [INFO ] Flatten gal took : 40 ms
[2022-05-20 16:37:46] [INFO ] Applying decomposition
[2022-05-20 16:37:46] [INFO ] Flatten gal took : 41 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/graph7475796773344715026.txt' '-o' '/tmp/graph7475796773344715026.bin' '-w' '/tmp/graph7475796773344715026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7475796773344715026.bin' '-l' '-1' '-v' '-w' '/tmp/graph7475796773344715026.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:37:46] [INFO ] Decomposing Gal with order
[2022-05-20 16:37:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:37:46] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 16:37:46] [INFO ] Flatten gal took : 48 ms
[2022-05-20 16:37:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 824 labels/synchronizations in 24 ms.
[2022-05-20 16:37:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5623314296519422093.gal : 4 ms
[2022-05-20 16:37:47] [INFO ] Time to serialize properties into /tmp/CTLFireability4274940168913341488.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5623314296519422093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4274940168913341488.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 17:04:40] [INFO ] Applying decomposition
[2022-05-20 17:04:41] [INFO ] Flatten gal took : 236 ms
[2022-05-20 17:04:41] [INFO ] Decomposing Gal with order
[2022-05-20 17:04:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 17:04:42] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 17:04:42] [INFO ] Flatten gal took : 839 ms
[2022-05-20 17:04:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 122 ms.
[2022-05-20 17:04:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8919033281932979203.gal : 38 ms
[2022-05-20 17:04:42] [INFO ] Time to serialize properties into /tmp/CTLFireability1738039523141023791.ctl : 12 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8919033281932979203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1738039523141023791.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.89893e+99,73.966,1676996,21177,28,2.92579e+06,793,1275,7.39046e+06,29,778,0

Converting to forward existential form...Done !
original formula: EF(((((u52.p178==1)&&(u53.p184==1)) * ((u56.p191==1) * EF(((((((u168.p584==1)&&(u169.p590==1))&&(u172.p597==1))||(((u126.p437==1)&&(u130....530
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (((u52.p178==1)&&(u53.p184==1)) * ((u56.p191==1) * E(TRUE U ((((((u168.p584==1)&&(u169.p59...916
Reverse transition relation is NOT exact ! Due to transitions t304, t307, t310, t317, t320, t324, t326, t331, t336, t339, t344, t348, t350, t356, t361, t36...4105

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -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="ShieldRVs-PT-050A"
export BK_EXAMINATION="CTLFireability"
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 ShieldRVs-PT-050A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025900850"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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