MCC'2024- Execution of r356-tall-171683760400122

About the Execution of ITS-Tools for ShieldIIPs-PT-030B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16205.283	3600000.00	3951421.00	10015.00	[undef]	Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683760400122.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldIIPs-PT-030B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760400122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 940K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 503K May 18 16:43 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 ShieldIIPs-PT-030B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-030B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716903295112

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 13:34:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 13:34:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:34:56] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-28 13:34:56] [INFO ] Transformed 1803 places.
[2024-05-28 13:34:56] [INFO ] Transformed 1773 transitions.
[2024-05-28 13:34:56] [INFO ] Found NUPN structural information;
[2024-05-28 13:34:56] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 152 out of 1803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Discarding 188 places :
Symmetric choice reduction at 0 with 188 rule applications. Total rules 188 place count 1615 transition count 1585
Iterating global reduction 0 with 188 rules applied. Total rules applied 376 place count 1615 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 377 place count 1614 transition count 1584
Iterating global reduction 0 with 1 rules applied. Total rules applied 378 place count 1614 transition count 1584
Applied a total of 378 rules in 433 ms. Remains 1614 /1803 variables (removed 189) and now considering 1584/1773 (removed 189) transitions.
// Phase 1: matrix 1584 rows 1614 cols
[2024-05-28 13:34:57] [INFO ] Computed 271 invariants in 34 ms
[2024-05-28 13:34:57] [INFO ] Implicit Places using invariants in 711 ms returned []
[2024-05-28 13:34:57] [INFO ] Invariant cache hit.
[2024-05-28 13:34:59] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
Running 1583 sub problems to find dead transitions.
[2024-05-28 13:34:59] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1613/3198 variables, and 0 constraints, problems are : Problem set: 0 solved, 1583 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1614 constraints, PredecessorRefiner: 1583/1583 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1613/3198 variables, and 0 constraints, problems are : Problem set: 0 solved, 1583 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1614 constraints, PredecessorRefiner: 0/1583 constraints, Known Traps: 0/0 constraints]
After SMT, in 60573ms problems are : Problem set: 0 solved, 1583 unsolved
Search for dead transitions found 0 dead transitions in 60603ms
Starting structural reductions in LTL mode, iteration 1 : 1614/1803 places, 1584/1773 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63140 ms. Remains : 1614/1803 places, 1584/1773 transitions.
Support contains 152 out of 1614 places after structural reductions.
[2024-05-28 13:36:00] [INFO ] Flatten gal took : 144 ms
[2024-05-28 13:36:00] [INFO ] Flatten gal took : 85 ms
[2024-05-28 13:36:00] [INFO ] Input system was already deterministic with 1584 transitions.
RANDOM walk for 40000 steps (8 resets) in 2066 ms. (19 steps per ms) remains 7/86 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
[2024-05-28 13:36:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 287/305 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1309/1614 variables, 236/271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 13:36:03] [INFO ] Deduced a trap composed of 34 places in 585 ms of which 70 ms to minimize.
[2024-05-28 13:36:03] [INFO ] Deduced a trap composed of 27 places in 436 ms of which 17 ms to minimize.
[2024-05-28 13:36:03] [INFO ] Deduced a trap composed of 18 places in 364 ms of which 6 ms to minimize.
[2024-05-28 13:36:04] [INFO ] Deduced a trap composed of 26 places in 311 ms of which 9 ms to minimize.
[2024-05-28 13:36:04] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 5 ms to minimize.
[2024-05-28 13:36:04] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 5 ms to minimize.
[2024-05-28 13:36:05] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 6 ms to minimize.
[2024-05-28 13:36:05] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 5 ms to minimize.
[2024-05-28 13:36:05] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 5 ms to minimize.
[2024-05-28 13:36:05] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 4 ms to minimize.
[2024-05-28 13:36:06] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 4 ms to minimize.
[2024-05-28 13:36:06] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 5 ms to minimize.
[2024-05-28 13:36:06] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 5 ms to minimize.
[2024-05-28 13:36:06] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 5 ms to minimize.
SMT process timed out in 5220ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 1614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1614/1614 places, 1584/1584 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 1614 transition count 1438
Reduce places removed 146 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 147 rules applied. Total rules applied 293 place count 1468 transition count 1437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 294 place count 1467 transition count 1437
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 294 place count 1467 transition count 1287
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 594 place count 1317 transition count 1287
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 609 place count 1302 transition count 1272
Iterating global reduction 3 with 15 rules applied. Total rules applied 624 place count 1302 transition count 1272
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 624 place count 1302 transition count 1266
Deduced a syphon composed of 6 places in 22 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 636 place count 1296 transition count 1266
Performed 525 Post agglomeration using F-continuation condition.Transition count delta: 525
Deduced a syphon composed of 525 places in 23 ms
Reduce places removed 525 places and 0 transitions.
Iterating global reduction 3 with 1050 rules applied. Total rules applied 1686 place count 771 transition count 741
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 205 times.
Drop transitions (Partial Free agglomeration) removed 205 transitions
Iterating global reduction 3 with 205 rules applied. Total rules applied 1891 place count 771 transition count 741
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1892 place count 770 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1893 place count 769 transition count 740
Applied a total of 1893 rules in 510 ms. Remains 769 /1614 variables (removed 845) and now considering 740/1584 (removed 844) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 511 ms. Remains : 769/1614 places, 740/1584 transitions.
RANDOM walk for 40000 steps (8 resets) in 620 ms. (64 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 5/5 properties
// Phase 1: matrix 740 rows 769 cols
[2024-05-28 13:36:08] [INFO ] Computed 270 invariants in 20 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 79/93 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 38/131 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 193/324 variables, 131/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 257/581 variables, 120/293 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 36/329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/587 variables, 5/334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 21/608 variables, 9/347 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/608 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/608 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/610 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/610 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 239/849 variables, 141/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/849 variables, 36/529 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/849 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 5/854 variables, 6/535 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/854 variables, 5/540 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/854 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 8/862 variables, 4/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/862 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/862 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 142/1004 variables, 75/627 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1004 variables, 26/653 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1004 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 4/1008 variables, 4/657 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1008 variables, 4/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1008 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 8/1016 variables, 4/665 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1016 variables, 8/673 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1016 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 130/1146 variables, 64/737 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1146 variables, 18/755 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1146 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 4/1150 variables, 3/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1150 variables, 2/760 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1150 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 4/1154 variables, 2/762 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1154 variables, 4/766 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1154 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 90/1244 variables, 50/816 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1244 variables, 15/831 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1244 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (OVERLAPS) 3/1247 variables, 5/836 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1247 variables, 3/839 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1247 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (OVERLAPS) 2/1249 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1249 variables, 2/842 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1249 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (OVERLAPS) 53/1302 variables, 32/874 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1302 variables, 10/884 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1302 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (OVERLAPS) 2/1304 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1304 variables, 2/888 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1304 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (OVERLAPS) 4/1308 variables, 2/890 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1308 variables, 4/894 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1308 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (OVERLAPS) 26/1334 variables, 14/908 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1334 variables, 6/914 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1334 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (OVERLAPS) 25/1359 variables, 12/926 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1359 variables, 3/929 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1359 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (OVERLAPS) 1/1360 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1360 variables, 1/931 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1360 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (OVERLAPS) 2/1362 variables, 1/932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1362 variables, 2/934 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1362 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (OVERLAPS) 21/1383 variables, 10/944 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1383 variables, 4/948 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1383 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (OVERLAPS) 25/1408 variables, 12/960 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1408 variables, 3/963 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1408 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (OVERLAPS) 1/1409 variables, 1/964 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1409 variables, 1/965 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1409 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 84 (OVERLAPS) 2/1411 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1411 variables, 2/968 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1411 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 87 (OVERLAPS) 21/1432 variables, 10/978 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1432 variables, 4/982 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1432 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 90 (OVERLAPS) 25/1457 variables, 12/994 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1457 variables, 3/997 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1457 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 93 (OVERLAPS) 1/1458 variables, 1/998 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1458 variables, 1/999 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1458 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 96 (OVERLAPS) 2/1460 variables, 1/1000 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1460 variables, 2/1002 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1460 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 99 (OVERLAPS) 21/1481 variables, 10/1012 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1481 variables, 4/1016 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1481 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 102 (OVERLAPS) 20/1501 variables, 10/1026 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1501 variables, 2/1028 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1501 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 105 (OVERLAPS) 2/1503 variables, 1/1029 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1503 variables, 2/1031 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1503 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 108 (OVERLAPS) 1/1504 variables, 1/1032 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1504 variables, 1/1033 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1504 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 111 (OVERLAPS) 5/1509 variables, 4/1037 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1509 variables, 2/1039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1509 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 114 (OVERLAPS) 0/1509 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1509/1509 variables, and 1039 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3525 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 769/769 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 79/93 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 38/131 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:11] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 193/324 variables, 131/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 257/581 variables, 120/294 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 36/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:11] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/587 variables, 5/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 21/608 variables, 9/357 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/608 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 2/610 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 239/849 variables, 141/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/849 variables, 36/539 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/849 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/849 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 5/854 variables, 6/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/854 variables, 5/556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/854 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 8/862 variables, 4/560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/862 variables, 8/568 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/862 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 142/1004 variables, 75/643 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1004 variables, 26/669 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:13] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:36:13] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1004 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1004 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 4/1008 variables, 4/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1008 variables, 4/679 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1008 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 8/1016 variables, 4/683 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1016 variables, 8/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1016 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 130/1146 variables, 64/755 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1146 variables, 18/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:13] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:36:13] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:36:13] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/1146 variables, 3/776 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1146 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (OVERLAPS) 4/1150 variables, 3/779 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1150 variables, 2/781 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:14] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/1150 variables, 1/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1150 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (OVERLAPS) 4/1154 variables, 2/784 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1154 variables, 4/788 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1154 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (OVERLAPS) 90/1244 variables, 50/838 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1244 variables, 15/853 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1244 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (OVERLAPS) 3/1247 variables, 5/858 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1247 variables, 3/861 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:14] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 3 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1247 variables, 1/862 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1247 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (OVERLAPS) 2/1249 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1249 variables, 2/865 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1249 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (OVERLAPS) 53/1302 variables, 32/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1302 variables, 10/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:15] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-28 13:36:15] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 8 ms to minimize.
At refinement iteration 65 (INCLUDED_ONLY) 0/1302 variables, 2/909 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1302 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (OVERLAPS) 2/1304 variables, 2/911 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1304 variables, 2/913 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1304 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (OVERLAPS) 4/1308 variables, 2/915 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1308 variables, 4/919 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1308 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (OVERLAPS) 26/1334 variables, 14/933 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1334 variables, 6/939 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:15] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-05-28 13:36:16] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-05-28 13:36:16] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:36:16] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
At refinement iteration 75 (INCLUDED_ONLY) 0/1334 variables, 4/943 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1334 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (OVERLAPS) 25/1359 variables, 12/955 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1359 variables, 3/958 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:16] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-05-28 13:36:16] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-28 13:36:16] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:36:16] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:36:16] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-28 13:36:16] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
At refinement iteration 79 (INCLUDED_ONLY) 0/1359 variables, 6/964 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1359 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (OVERLAPS) 1/1360 variables, 1/965 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1360 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:17] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:36:17] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
At refinement iteration 83 (INCLUDED_ONLY) 0/1360 variables, 2/968 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1360 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 85 (OVERLAPS) 2/1362 variables, 1/969 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1362 variables, 2/971 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1362 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 88 (OVERLAPS) 21/1383 variables, 10/981 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1383 variables, 4/985 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1383 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 91 (OVERLAPS) 25/1408 variables, 12/997 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1408 variables, 3/1000 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:18] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:36:18] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:36:18] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
At refinement iteration 93 (INCLUDED_ONLY) 0/1408 variables, 3/1003 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1408 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 95 (OVERLAPS) 1/1409 variables, 1/1004 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1409 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1409 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 98 (OVERLAPS) 2/1411 variables, 1/1006 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1411 variables, 2/1008 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1411 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 101 (OVERLAPS) 21/1432 variables, 10/1018 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1432 variables, 4/1022 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1432 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 104 (OVERLAPS) 25/1457 variables, 12/1034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1457 variables, 3/1037 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:36:19] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
At refinement iteration 106 (INCLUDED_ONLY) 0/1457 variables, 1/1038 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1457 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 108 (OVERLAPS) 1/1458 variables, 1/1039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1458 variables, 1/1040 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1458 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 111 (OVERLAPS) 2/1460 variables, 1/1041 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1460 variables, 2/1043 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1460 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 114 (OVERLAPS) 21/1481 variables, 10/1053 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1481 variables, 4/1057 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1481 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 117 (OVERLAPS) 20/1501 variables, 10/1067 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1501 variables, 2/1069 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1501 variables, 0/1069 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 120 (OVERLAPS) 2/1503 variables, 1/1070 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1503 variables, 2/1072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1503 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 123 (OVERLAPS) 1/1504 variables, 1/1073 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1504 variables, 1/1074 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1504 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 126 (OVERLAPS) 5/1509 variables, 4/1078 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1509 variables, 2/1080 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1509 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 129 (OVERLAPS) 0/1509 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1509/1509 variables, and 1080 constraints, problems are : Problem set: 0 solved, 5 unsolved in 9054 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 769/769 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 36/36 constraints]
After SMT, in 12615ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2153 ms.
Support contains 14 out of 769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 740/740 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 769 transition count 739
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 768 transition count 739
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 765 transition count 736
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 763 transition count 734
Applied a total of 10 rules in 87 ms. Remains 763 /769 variables (removed 6) and now considering 734/740 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 763/769 places, 734/740 transitions.
RANDOM walk for 40000 steps (8 resets) in 579 ms. (68 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
// Phase 1: matrix 734 rows 763 cols
[2024-05-28 13:36:23] [INFO ] Computed 270 invariants in 13 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/84 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 38/122 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:23] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 176/298 variables, 122/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 229/527 variables, 107/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 33/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/530 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 4/534 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 4/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 242/776 variables, 122/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/776 variables, 33/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:24] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/776 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/776 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 8/784 variables, 9/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/784 variables, 8/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/784 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 10/794 variables, 5/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/794 variables, 10/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/794 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 2/796 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/796 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 155/951 variables, 86/590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/951 variables, 30/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:24] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:36:24] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/951 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/951 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 4/955 variables, 5/627 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/955 variables, 4/631 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/955 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 6/961 variables, 3/634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/961 variables, 6/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/961 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 129/1090 variables, 64/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1090 variables, 19/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:24] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-28 13:36:25] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:36:25] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
[2024-05-28 13:36:25] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-28 13:36:25] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1090 variables, 5/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 42 (INCLUDED_ONLY) 0/1090 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 2/1092 variables, 2/730 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1092 variables, 2/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1092 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 4/1096 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1096 variables, 4/738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1096 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 107/1203 variables, 52/790 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1203 variables, 17/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1203 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 3/1206 variables, 5/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1206 variables, 3/815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1206 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 2/1208 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1208 variables, 2/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1208 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 72/1280 variables, 44/862 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1280 variables, 13/875 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1280 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 2/1282 variables, 2/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1282 variables, 2/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1282 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 4/1286 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1286 variables, 4/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1286 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 35/1321 variables, 20/905 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1321 variables, 7/912 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1321 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 1/1322 variables, 2/914 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1322 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1322 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (OVERLAPS) 27/1349 variables, 14/929 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1349 variables, 4/933 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1349 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (OVERLAPS) 1/1350 variables, 1/934 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1350 variables, 1/935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1350 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (OVERLAPS) 2/1352 variables, 1/936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1352 variables, 2/938 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1352 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (OVERLAPS) 21/1373 variables, 10/948 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1373 variables, 4/952 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1373 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (OVERLAPS) 25/1398 variables, 12/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1398 variables, 3/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1398 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (OVERLAPS) 1/1399 variables, 1/968 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1399 variables, 1/969 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1399 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 91 (OVERLAPS) 2/1401 variables, 1/970 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1401 variables, 2/972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1401 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 94 (OVERLAPS) 21/1422 variables, 10/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1422 variables, 4/986 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1422 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 97 (OVERLAPS) 25/1447 variables, 12/998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1447 variables, 3/1001 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1447 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 100 (OVERLAPS) 1/1448 variables, 1/1002 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1448 variables, 1/1003 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1448 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 103 (OVERLAPS) 2/1450 variables, 1/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1450 variables, 2/1006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1450 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 106 (OVERLAPS) 21/1471 variables, 10/1016 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1471 variables, 4/1020 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1471 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 109 (OVERLAPS) 18/1489 variables, 9/1029 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1489 variables, 2/1031 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1489 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 112 (OVERLAPS) 2/1491 variables, 1/1032 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1491 variables, 2/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1491 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 115 (OVERLAPS) 1/1492 variables, 1/1035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1492 variables, 1/1036 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1492 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 118 (OVERLAPS) 5/1497 variables, 4/1040 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1497 variables, 2/1042 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1497 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 121 (OVERLAPS) 0/1497 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1497/1497 variables, and 1042 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4073 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/84 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 38/122 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:27] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 176/298 variables, 122/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 229/527 variables, 107/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 33/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/530 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/534 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/534 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 242/776 variables, 122/444 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/776 variables, 33/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/776 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/776 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 8/784 variables, 9/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/784 variables, 8/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/784 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 10/794 variables, 5/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/794 variables, 10/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:28] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/794 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/794 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 2/796 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/796 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 155/951 variables, 86/600 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/951 variables, 30/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/951 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:28] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/951 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:28] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/951 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/951 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 4/955 variables, 5/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/955 variables, 4/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:28] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:36:28] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/955 variables, 2/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/955 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 6/961 variables, 3/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/961 variables, 6/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/961 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 129/1090 variables, 64/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1090 variables, 19/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1090 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1090 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 2/1092 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1092 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:29] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/1092 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1092 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 4/1096 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1096 variables, 4/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1096 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 107/1203 variables, 52/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1203 variables, 17/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1203 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 3/1206 variables, 5/823 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1206 variables, 3/826 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1206 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 2/1208 variables, 1/827 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1208 variables, 2/829 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:29] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/1208 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1208 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 72/1280 variables, 44/874 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1280 variables, 13/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:29] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:36:30] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
At refinement iteration 70 (INCLUDED_ONLY) 0/1280 variables, 2/889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:30] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
At refinement iteration 71 (INCLUDED_ONLY) 0/1280 variables, 1/890 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1280 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (OVERLAPS) 2/1282 variables, 2/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1282 variables, 2/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1282 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (OVERLAPS) 4/1286 variables, 2/896 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1286 variables, 4/900 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1286 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (OVERLAPS) 35/1321 variables, 20/920 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1321 variables, 7/927 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:30] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:36:30] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
At refinement iteration 81 (INCLUDED_ONLY) 0/1321 variables, 2/929 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1321 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (OVERLAPS) 1/1322 variables, 2/931 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1322 variables, 1/932 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1322 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (OVERLAPS) 27/1349 variables, 14/946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1349 variables, 4/950 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:31] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-28 13:36:31] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:36:31] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:36:31] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-05-28 13:36:31] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
At refinement iteration 88 (INCLUDED_ONLY) 0/1349 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1349 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 90 (OVERLAPS) 1/1350 variables, 1/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1350 variables, 1/957 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1350 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 93 (OVERLAPS) 2/1352 variables, 1/958 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1352 variables, 2/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1352 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 96 (OVERLAPS) 21/1373 variables, 10/970 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1373 variables, 4/974 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1373 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 99 (OVERLAPS) 25/1398 variables, 12/986 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1398 variables, 3/989 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1398 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 102 (OVERLAPS) 1/1399 variables, 1/990 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1399 variables, 1/991 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1399 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 105 (OVERLAPS) 2/1401 variables, 1/992 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1401 variables, 2/994 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:32] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-28 13:36:32] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
At refinement iteration 107 (INCLUDED_ONLY) 0/1401 variables, 2/996 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1401 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 109 (OVERLAPS) 21/1422 variables, 10/1006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1422 variables, 4/1010 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1422 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 112 (OVERLAPS) 25/1447 variables, 12/1022 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1447 variables, 3/1025 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:33] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
At refinement iteration 114 (INCLUDED_ONLY) 0/1447 variables, 1/1026 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1447 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 116 (OVERLAPS) 1/1448 variables, 1/1027 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1448 variables, 1/1028 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1448 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 119 (OVERLAPS) 2/1450 variables, 1/1029 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1450 variables, 2/1031 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1450 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 122 (OVERLAPS) 21/1471 variables, 10/1041 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1471 variables, 4/1045 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1471 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 125 (OVERLAPS) 18/1489 variables, 9/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1489 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1489 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 128 (OVERLAPS) 2/1491 variables, 1/1057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1491 variables, 2/1059 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1491 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 131 (OVERLAPS) 1/1492 variables, 1/1060 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1492 variables, 1/1061 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:33] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
At refinement iteration 133 (INCLUDED_ONLY) 0/1492 variables, 1/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1492 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 135 (OVERLAPS) 5/1497 variables, 4/1066 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1497 variables, 2/1068 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1497 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 138 (OVERLAPS) 0/1497 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1497/1497 variables, and 1068 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6973 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 31/31 constraints]
After SMT, in 11068ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2461 ms.
Support contains 12 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 734/734 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 733
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 762 transition count 733
Applied a total of 3 rules in 62 ms. Remains 762 /763 variables (removed 1) and now considering 733/734 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 762/763 places, 733/734 transitions.
RANDOM walk for 40000 steps (8 resets) in 500 ms. (79 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 145320 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 4
Probabilistic random walk after 145320 steps, saw 118553 distinct states, run finished after 3005 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 733 rows 762 cols
[2024-05-28 13:36:40] [INFO ] Computed 270 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/84 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 38/122 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:40] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:36:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 177/299 variables, 122/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 229/528 variables, 108/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 34/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/530 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 4/534 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 241/775 variables, 122/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/775 variables, 34/472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:41] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:36:41] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/775 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/775 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 7/782 variables, 8/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/782 variables, 7/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/782 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 12/794 variables, 6/495 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/794 variables, 10/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/794 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 155/949 variables, 86/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/949 variables, 30/621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/949 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 4/953 variables, 5/626 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/953 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/953 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 6/959 variables, 3/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/959 variables, 6/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/959 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 36 (OVERLAPS) 129/1088 variables, 64/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1088 variables, 19/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1088 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 2/1090 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1090 variables, 2/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1090 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 4/1094 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1094 variables, 4/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1094 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 107/1201 variables, 52/784 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1201 variables, 17/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1201 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 3/1204 variables, 5/806 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1204 variables, 3/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1204 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 2/1206 variables, 1/810 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1206 variables, 2/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1206 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 72/1278 variables, 44/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1278 variables, 13/869 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1278 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 2/1280 variables, 2/871 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1280 variables, 2/873 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1280 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 4/1284 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1284 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1284 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (OVERLAPS) 35/1319 variables, 20/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1319 variables, 7/906 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1319 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 1/1320 variables, 2/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1320 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1320 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (OVERLAPS) 27/1347 variables, 14/923 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1347 variables, 4/927 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1347 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (OVERLAPS) 1/1348 variables, 1/928 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1348 variables, 1/929 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1348 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (OVERLAPS) 2/1350 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1350 variables, 2/932 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1350 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (OVERLAPS) 21/1371 variables, 10/942 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1371 variables, 4/946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1371 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (OVERLAPS) 25/1396 variables, 12/958 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1396 variables, 3/961 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1396 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (OVERLAPS) 1/1397 variables, 1/962 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1397 variables, 1/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1397 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (OVERLAPS) 2/1399 variables, 1/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1399 variables, 2/966 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1399 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 90 (OVERLAPS) 21/1420 variables, 10/976 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1420 variables, 4/980 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1420 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 93 (OVERLAPS) 25/1445 variables, 12/992 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1445 variables, 3/995 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1445 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 96 (OVERLAPS) 1/1446 variables, 1/996 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1446 variables, 1/997 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1446 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 99 (OVERLAPS) 2/1448 variables, 1/998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1448 variables, 2/1000 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1448 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 102 (OVERLAPS) 21/1469 variables, 10/1010 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1469 variables, 4/1014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1469 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 105 (OVERLAPS) 18/1487 variables, 9/1023 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1487 variables, 2/1025 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1487 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 108 (OVERLAPS) 2/1489 variables, 1/1026 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1489 variables, 2/1028 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1489 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 111 (OVERLAPS) 1/1490 variables, 1/1029 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1490 variables, 1/1030 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1490 variables, 0/1030 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 114 (OVERLAPS) 5/1495 variables, 4/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1495 variables, 2/1036 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1495 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 117 (OVERLAPS) 0/1495 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1495/1495 variables, and 1036 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3385 ms.
Refiners :[Positive P Invariants (semi-flows): 269/269 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 762/762 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/84 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 38/122 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:43] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 177/299 variables, 122/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 229/528 variables, 108/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 34/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:44] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-28 13:36:44] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/530 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/534 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/534 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 241/775 variables, 122/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/775 variables, 34/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/775 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:44] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/775 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/775 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 7/782 variables, 8/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/782 variables, 7/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/782 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 12/794 variables, 6/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/794 variables, 10/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/794 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 155/949 variables, 86/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/949 variables, 30/629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/949 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 4/953 variables, 5/634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/953 variables, 4/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/953 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 6/959 variables, 3/641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/959 variables, 6/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/959 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 129/1088 variables, 64/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1088 variables, 19/730 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1088 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 2/1090 variables, 2/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1090 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/1090 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/1090 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1090 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 4/1094 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1094 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/1094 variables, 3/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1094 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 107/1201 variables, 52/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1201 variables, 17/815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:46] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:36:46] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/1201 variables, 2/817 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1201 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 3/1204 variables, 5/822 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1204 variables, 3/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:46] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:36:46] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1204 variables, 2/827 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1204 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 2/1206 variables, 1/828 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1206 variables, 2/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:46] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/1206 variables, 1/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:47] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:36:47] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:36:47] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
At refinement iteration 63 (INCLUDED_ONLY) 0/1206 variables, 3/834 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:47] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 64 (INCLUDED_ONLY) 0/1206 variables, 1/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1206 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 72/1278 variables, 44/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1278 variables, 13/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:47] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-28 13:36:47] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/1278 variables, 2/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1278 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 2/1280 variables, 2/896 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1280 variables, 2/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:47] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
At refinement iteration 72 (INCLUDED_ONLY) 0/1280 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1280 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 4/1284 variables, 2/901 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1284 variables, 4/905 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1284 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (OVERLAPS) 35/1319 variables, 20/925 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1319 variables, 7/932 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
At refinement iteration 79 (INCLUDED_ONLY) 0/1319 variables, 1/933 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1319 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (OVERLAPS) 1/1320 variables, 2/935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1320 variables, 1/936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1320 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (OVERLAPS) 27/1347 variables, 14/950 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1347 variables, 4/954 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:36:49] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
At refinement iteration 86 (INCLUDED_ONLY) 0/1347 variables, 5/959 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:49] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
At refinement iteration 87 (INCLUDED_ONLY) 0/1347 variables, 1/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:49] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-28 13:36:49] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
At refinement iteration 88 (INCLUDED_ONLY) 0/1347 variables, 2/962 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1347 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 90 (OVERLAPS) 1/1348 variables, 1/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1348 variables, 1/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1348 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 93 (OVERLAPS) 2/1350 variables, 1/965 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1350 variables, 2/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:36:49] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:36:50] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 95 (INCLUDED_ONLY) 0/1350 variables, 2/969 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1350 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 97 (OVERLAPS) 21/1371 variables, 10/979 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1371 variables, 4/983 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1371 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 100 (OVERLAPS) 25/1396 variables, 12/995 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1396 variables, 3/998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1396 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 103 (OVERLAPS) 1/1397 variables, 1/999 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1397 variables, 1/1000 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1397 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 106 (OVERLAPS) 2/1399 variables, 1/1001 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1399 variables, 2/1003 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1399 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 109 (OVERLAPS) 21/1420 variables, 10/1013 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1420 variables, 4/1017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1420 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 112 (OVERLAPS) 25/1445 variables, 12/1029 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1445 variables, 3/1032 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1445 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 115 (OVERLAPS) 1/1446 variables, 1/1033 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1446 variables, 1/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1446 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 118 (OVERLAPS) 2/1448 variables, 1/1035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1448 variables, 2/1037 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1448 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 121 (OVERLAPS) 21/1469 variables, 10/1047 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1469 variables, 4/1051 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1469 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 124 (OVERLAPS) 18/1487 variables, 9/1060 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1487 variables, 2/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1487 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 127 (OVERLAPS) 2/1489 variables, 1/1063 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1489 variables, 2/1065 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1489 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 130 (OVERLAPS) 1/1490 variables, 1/1066 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1490 variables, 1/1067 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1490 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 133 (OVERLAPS) 5/1495 variables, 4/1071 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1495 variables, 2/1073 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1495 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 136 (OVERLAPS) 0/1495 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1495/1495 variables, and 1073 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8095 ms.
Refiners :[Positive P Invariants (semi-flows): 269/269 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 762/762 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 37/37 constraints]
After SMT, in 11496ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1430 ms.
Support contains 12 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 733/733 transitions.
Applied a total of 0 rules in 23 ms. Remains 762 /762 variables (removed 0) and now considering 733/733 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 762/762 places, 733/733 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 733/733 transitions.
Applied a total of 0 rules in 22 ms. Remains 762 /762 variables (removed 0) and now considering 733/733 (removed 0) transitions.
[2024-05-28 13:36:53] [INFO ] Invariant cache hit.
[2024-05-28 13:36:53] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-28 13:36:53] [INFO ] Invariant cache hit.
[2024-05-28 13:36:54] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
[2024-05-28 13:36:54] [INFO ] Redundant transitions in 33 ms returned []
Running 726 sub problems to find dead transitions.
[2024-05-28 13:36:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/756 variables, 235/235 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/756 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-28 13:37:04] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 13:37:04] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:37:05] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 13:37:05] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 13:37:05] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-05-28 13:37:05] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 13:37:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 13:37:05] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 13:37:05] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 13:37:05] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
[2024-05-28 13:37:06] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 13:37:06] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-28 13:37:06] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-28 13:37:06] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-05-28 13:37:06] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 13:37:06] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 13:37:06] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 13:37:07] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 13:37:07] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 13:37:07] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/756 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-28 13:37:11] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 13:37:11] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 13:37:11] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 13:37:11] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 13:37:11] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 13:37:11] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 13:37:11] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 13:37:11] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 13:37:11] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 13:37:12] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 13:37:12] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 13:37:12] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 13:37:12] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 13:37:12] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 13:37:12] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 13:37:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 13:37:12] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 13:37:12] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 13:37:13] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 13:37:13] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-28 13:37:24] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 756/1495 variables, and 277 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 235/269 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/762 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/756 variables, 235/235 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/756 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/756 variables, 41/277 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-28 13:37:29] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 13:37:29] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 13:37:30] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 13:37:30] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 13:37:30] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-28 13:37:31] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:37:31] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 13:37:31] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:37:31] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 13:37:31] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 13:37:31] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 13:37:31] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 13:37:31] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 13:37:31] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:37:31] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 15/292 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 5 (OVERLAPS) 6/762 variables, 34/326 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-28 13:37:43] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 13:37:43] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-28 13:37:43] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-28 13:37:43] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 13:37:43] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-28 13:37:43] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-28 13:37:44] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-28 13:37:45] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-28 13:37:45] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-28 13:37:45] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-28 13:37:45] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:37:45] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:37:47] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 13:37:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 13:37:47] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:37:47] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:37:47] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 13:37:47] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 13:37:48] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 13:37:48] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 20/346 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-28 13:37:52] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-28 13:37:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:37:53] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 13:37:54] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:37:54] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 13:37:54] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/1495 variables, and 352 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 269/269 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/762 constraints, PredecessorRefiner: 0/726 constraints, Known Traps: 82/82 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61449 ms. Remains : 762/762 places, 733/733 transitions.
[2024-05-28 13:37:54] [INFO ] Flatten gal took : 57 ms
[2024-05-28 13:37:55] [INFO ] Flatten gal took : 56 ms
[2024-05-28 13:37:55] [INFO ] Input system was already deterministic with 1584 transitions.
Computed a total of 370 stabilizing places and 370 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 1584/1584 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1594 transition count 1564
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1594 transition count 1564
Applied a total of 40 rules in 122 ms. Remains 1594 /1614 variables (removed 20) and now considering 1564/1584 (removed 20) transitions.
// Phase 1: matrix 1564 rows 1594 cols
[2024-05-28 13:37:55] [INFO ] Computed 271 invariants in 7 ms
[2024-05-28 13:37:55] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-28 13:37:55] [INFO ] Invariant cache hit.
[2024-05-28 13:37:57] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1741 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-05-28 13:37:57] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1593/3158 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1594 constraints, PredecessorRefiner: 1563/1563 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1593/3158 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1594 constraints, PredecessorRefiner: 0/1563 constraints, Known Traps: 0/0 constraints]
After SMT, in 60376ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 60390ms
Starting structural reductions in LTL mode, iteration 1 : 1594/1614 places, 1564/1584 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62257 ms. Remains : 1594/1614 places, 1564/1584 transitions.
[2024-05-28 13:38:57] [INFO ] Flatten gal took : 40 ms
[2024-05-28 13:38:57] [INFO ] Flatten gal took : 41 ms
[2024-05-28 13:38:57] [INFO ] Input system was already deterministic with 1564 transitions.
[2024-05-28 13:38:57] [INFO ] Flatten gal took : 55 ms
[2024-05-28 13:38:57] [INFO ] Flatten gal took : 53 ms
[2024-05-28 13:38:57] [INFO ] Time to serialize gal into /tmp/CTLFireability666545708178745001.gal : 24 ms
[2024-05-28 13:38:57] [INFO ] Time to serialize properties into /tmp/CTLFireability12204166500111751129.ctl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability666545708178745001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12204166500111751129.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:39:27] [INFO ] Flatten gal took : 41 ms
[2024-05-28 13:39:27] [INFO ] Applying decomposition
[2024-05-28 13:39:27] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16861541760586379205.txt' '-o' '/tmp/graph16861541760586379205.bin' '-w' '/tmp/graph16861541760586379205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16861541760586379205.bin' '-l' '-1' '-v' '-w' '/tmp/graph16861541760586379205.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:39:28] [INFO ] Decomposing Gal with order
[2024-05-28 13:39:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:39:28] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 13:39:28] [INFO ] Flatten gal took : 131 ms
[2024-05-28 13:39:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-28 13:39:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9453059713125021780.gal : 25 ms
[2024-05-28 13:39:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7073089894875286219.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9453059713125021780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7073089894875286219.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 1584/1584 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1592 transition count 1562
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1592 transition count 1562
Applied a total of 44 rules in 76 ms. Remains 1592 /1614 variables (removed 22) and now considering 1562/1584 (removed 22) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2024-05-28 13:39:59] [INFO ] Computed 271 invariants in 12 ms
[2024-05-28 13:39:59] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-28 13:39:59] [INFO ] Invariant cache hit.
[2024-05-28 13:40:00] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-28 13:40:00] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1591/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1592 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1591/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1592 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60393ms
Starting structural reductions in LTL mode, iteration 1 : 1592/1614 places, 1562/1584 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62307 ms. Remains : 1592/1614 places, 1562/1584 transitions.
[2024-05-28 13:41:01] [INFO ] Flatten gal took : 38 ms
[2024-05-28 13:41:01] [INFO ] Flatten gal took : 39 ms
[2024-05-28 13:41:01] [INFO ] Input system was already deterministic with 1562 transitions.
[2024-05-28 13:41:01] [INFO ] Flatten gal took : 37 ms
[2024-05-28 13:41:01] [INFO ] Flatten gal took : 37 ms
[2024-05-28 13:41:01] [INFO ] Time to serialize gal into /tmp/CTLFireability5337713025771851546.gal : 7 ms
[2024-05-28 13:41:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3845520784005010101.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5337713025771851546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3845520784005010101.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:41:31] [INFO ] Flatten gal took : 35 ms
[2024-05-28 13:41:31] [INFO ] Applying decomposition
[2024-05-28 13:41:31] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4681583731768957227.txt' '-o' '/tmp/graph4681583731768957227.bin' '-w' '/tmp/graph4681583731768957227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4681583731768957227.bin' '-l' '-1' '-v' '-w' '/tmp/graph4681583731768957227.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:41:31] [INFO ] Decomposing Gal with order
[2024-05-28 13:41:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:41:31] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 13:41:31] [INFO ] Flatten gal took : 82 ms
[2024-05-28 13:41:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-28 13:41:31] [INFO ] Time to serialize gal into /tmp/CTLFireability13104067079367315990.gal : 14 ms
[2024-05-28 13:41:31] [INFO ] Time to serialize properties into /tmp/CTLFireability14085540132282648226.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13104067079367315990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14085540132282648226.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 1584/1584 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1595 transition count 1565
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1595 transition count 1565
Applied a total of 38 rules in 78 ms. Remains 1595 /1614 variables (removed 19) and now considering 1565/1584 (removed 19) transitions.
// Phase 1: matrix 1565 rows 1595 cols
[2024-05-28 13:42:02] [INFO ] Computed 271 invariants in 5 ms
[2024-05-28 13:42:02] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-28 13:42:02] [INFO ] Invariant cache hit.
[2024-05-28 13:42:03] [INFO ] Implicit Places using invariants and state equation in 1392 ms returned []
Implicit Place search using SMT with State Equation took 1845 ms to find 0 implicit places.
Running 1564 sub problems to find dead transitions.
[2024-05-28 13:42:03] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1594/3160 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1595 constraints, PredecessorRefiner: 1564/1564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1594/3160 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1595 constraints, PredecessorRefiner: 0/1564 constraints, Known Traps: 0/0 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 1564 unsolved
Search for dead transitions found 0 dead transitions in 60386ms
Starting structural reductions in LTL mode, iteration 1 : 1595/1614 places, 1565/1584 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62314 ms. Remains : 1595/1614 places, 1565/1584 transitions.
[2024-05-28 13:43:04] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:43:04] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:43:04] [INFO ] Input system was already deterministic with 1565 transitions.
[2024-05-28 13:43:04] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:43:04] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:43:04] [INFO ] Time to serialize gal into /tmp/CTLFireability6701336534158325004.gal : 6 ms
[2024-05-28 13:43:04] [INFO ] Time to serialize properties into /tmp/CTLFireability17487184611078239683.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6701336534158325004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17487184611078239683.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:43:34] [INFO ] Flatten gal took : 44 ms
[2024-05-28 13:43:34] [INFO ] Applying decomposition
[2024-05-28 13:43:34] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6553835607417107199.txt' '-o' '/tmp/graph6553835607417107199.bin' '-w' '/tmp/graph6553835607417107199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6553835607417107199.bin' '-l' '-1' '-v' '-w' '/tmp/graph6553835607417107199.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:43:34] [INFO ] Decomposing Gal with order
[2024-05-28 13:43:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:43:34] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 13:43:34] [INFO ] Flatten gal took : 75 ms
[2024-05-28 13:43:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-28 13:43:35] [INFO ] Time to serialize gal into /tmp/CTLFireability18352488686301793409.gal : 15 ms
[2024-05-28 13:43:35] [INFO ] Time to serialize properties into /tmp/CTLFireability2996120922482600284.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18352488686301793409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2996120922482600284.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 1584/1584 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1592 transition count 1562
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1592 transition count 1562
Applied a total of 44 rules in 93 ms. Remains 1592 /1614 variables (removed 22) and now considering 1562/1584 (removed 22) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2024-05-28 13:44:05] [INFO ] Computed 271 invariants in 19 ms
[2024-05-28 13:44:05] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-28 13:44:05] [INFO ] Invariant cache hit.
[2024-05-28 13:44:07] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-28 13:44:07] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1591/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1592 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1591/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1592 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60394ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Starting structural reductions in LTL mode, iteration 1 : 1592/1614 places, 1562/1584 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62350 ms. Remains : 1592/1614 places, 1562/1584 transitions.
[2024-05-28 13:45:07] [INFO ] Flatten gal took : 31 ms
[2024-05-28 13:45:07] [INFO ] Flatten gal took : 34 ms
[2024-05-28 13:45:07] [INFO ] Input system was already deterministic with 1562 transitions.
[2024-05-28 13:45:07] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:45:07] [INFO ] Flatten gal took : 34 ms
[2024-05-28 13:45:07] [INFO ] Time to serialize gal into /tmp/CTLFireability12217345944078519371.gal : 9 ms
[2024-05-28 13:45:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10262000207823916580.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12217345944078519371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10262000207823916580.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:45:37] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:45:37] [INFO ] Applying decomposition
[2024-05-28 13:45:37] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15611675680731975112.txt' '-o' '/tmp/graph15611675680731975112.bin' '-w' '/tmp/graph15611675680731975112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15611675680731975112.bin' '-l' '-1' '-v' '-w' '/tmp/graph15611675680731975112.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:45:37] [INFO ] Decomposing Gal with order
[2024-05-28 13:45:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:45:38] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 13:45:38] [INFO ] Flatten gal took : 59 ms
[2024-05-28 13:45:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-28 13:45:38] [INFO ] Time to serialize gal into /tmp/CTLFireability5241339212049676898.gal : 13 ms
[2024-05-28 13:45:38] [INFO ] Time to serialize properties into /tmp/CTLFireability13211090933858170052.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5241339212049676898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13211090933858170052.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 1584/1584 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1594 transition count 1564
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1594 transition count 1564
Applied a total of 40 rules in 85 ms. Remains 1594 /1614 variables (removed 20) and now considering 1564/1584 (removed 20) transitions.
// Phase 1: matrix 1564 rows 1594 cols
[2024-05-28 13:46:08] [INFO ] Computed 271 invariants in 10 ms
[2024-05-28 13:46:08] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-28 13:46:08] [INFO ] Invariant cache hit.
[2024-05-28 13:46:10] [INFO ] Implicit Places using invariants and state equation in 1419 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-05-28 13:46:10] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1593/3158 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1594 constraints, PredecessorRefiner: 1563/1563 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1593/3158 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1594 constraints, PredecessorRefiner: 0/1563 constraints, Known Traps: 0/0 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Starting structural reductions in LTL mode, iteration 1 : 1594/1614 places, 1564/1584 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62330 ms. Remains : 1594/1614 places, 1564/1584 transitions.
[2024-05-28 13:47:10] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:47:10] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:47:10] [INFO ] Input system was already deterministic with 1564 transitions.
[2024-05-28 13:47:10] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:47:10] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:47:10] [INFO ] Time to serialize gal into /tmp/CTLFireability5318248351281075685.gal : 5 ms
[2024-05-28 13:47:10] [INFO ] Time to serialize properties into /tmp/CTLFireability15760505940767932901.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5318248351281075685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15760505940767932901.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:47:40] [INFO ] Flatten gal took : 39 ms
[2024-05-28 13:47:40] [INFO ] Applying decomposition
[2024-05-28 13:47:40] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6240055499798602951.txt' '-o' '/tmp/graph6240055499798602951.bin' '-w' '/tmp/graph6240055499798602951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6240055499798602951.bin' '-l' '-1' '-v' '-w' '/tmp/graph6240055499798602951.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:47:41] [INFO ] Decomposing Gal with order
[2024-05-28 13:47:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:47:41] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 13:47:41] [INFO ] Flatten gal took : 58 ms
[2024-05-28 13:47:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 13:47:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5949860535508289064.gal : 34 ms
[2024-05-28 13:47:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6401929292534464656.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5949860535508289064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6401929292534464656.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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 : 1614/1614 places, 1584/1584 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1613 transition count 1435
Reduce places removed 148 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 149 rules applied. Total rules applied 297 place count 1465 transition count 1434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 298 place count 1464 transition count 1434
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 298 place count 1464 transition count 1283
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 600 place count 1313 transition count 1283
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 622 place count 1291 transition count 1261
Iterating global reduction 3 with 22 rules applied. Total rules applied 644 place count 1291 transition count 1261
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 644 place count 1291 transition count 1252
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 662 place count 1282 transition count 1252
Performed 523 Post agglomeration using F-continuation condition.Transition count delta: 523
Deduced a syphon composed of 523 places in 1 ms
Reduce places removed 523 places and 0 transitions.
Iterating global reduction 3 with 1046 rules applied. Total rules applied 1708 place count 759 transition count 729
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1710 place count 757 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1711 place count 756 transition count 727
Applied a total of 1711 rules in 245 ms. Remains 756 /1614 variables (removed 858) and now considering 727/1584 (removed 857) transitions.
// Phase 1: matrix 727 rows 756 cols
[2024-05-28 13:48:11] [INFO ] Computed 270 invariants in 4 ms
[2024-05-28 13:48:11] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-28 13:48:11] [INFO ] Invariant cache hit.
[2024-05-28 13:48:12] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
[2024-05-28 13:48:12] [INFO ] Redundant transitions in 113 ms returned [726]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 722 sub problems to find dead transitions.
// Phase 1: matrix 726 rows 756 cols
[2024-05-28 13:48:12] [INFO ] Computed 270 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/753 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-05-28 13:48:20] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-28 13:48:20] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 13:48:20] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 13:48:20] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 13:48:22] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 13:48:22] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 13:48:22] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:48:22] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-28 13:48:22] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-28 13:48:27] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 13:48:28] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 13:48:28] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/753 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-05-28 13:48:36] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/753 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1482 variables, and 64 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 51/270 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/753 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/753 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/753 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (OVERLAPS) 3/756 variables, 219/283 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-05-28 13:48:51] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 3 ms to minimize.
[2024-05-28 13:48:51] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 3 ms to minimize.
[2024-05-28 13:48:51] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:48:51] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-28 13:48:51] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 3 ms to minimize.
[2024-05-28 13:48:51] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 5 ms to minimize.
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:48:55] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:48:55] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:48:55] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/756 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-05-28 13:48:55] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-28 13:48:55] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:48:55] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 4 ms to minimize.
[2024-05-28 13:48:55] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-05-28 13:48:56] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:48:56] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:48:56] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:48:56] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:48:56] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:48:56] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:48:57] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 13:48:57] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-28 13:48:57] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-28 13:48:57] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 13:48:57] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-28 13:48:57] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-05-28 13:48:57] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 13:48:58] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 13:48:58] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-05-28 13:48:58] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-05-28 13:48:59] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:48:59] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-28 13:48:59] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:49:00] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 13:49:00] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:49:00] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:49:00] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2024-05-28 13:49:00] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 3 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-05-28 13:49:02] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-28 13:49:02] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-28 13:49:02] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 2 ms to minimize.
[2024-05-28 13:49:03] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-28 13:49:03] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 3 ms to minimize.
[2024-05-28 13:49:03] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-05-28 13:49:03] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 20/363 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:49:05] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-28 13:49:06] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:49:06] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 6 ms to minimize.
[2024-05-28 13:49:07] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:49:08] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 3 ms to minimize.
[2024-05-28 13:49:08] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-28 13:49:08] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-28 13:49:08] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:49:08] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
[2024-05-28 13:49:08] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-28 13:49:10] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-28 13:49:10] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 13:49:10] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-05-28 13:49:12] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 756/1482 variables, and 384 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 0/722 constraints, Known Traps: 114/114 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in SI_CTL mode, iteration 1 : 756/1614 places, 726/1584 transitions.
Applied a total of 0 rules in 31 ms. Remains 756 /756 variables (removed 0) and now considering 726/726 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 61605 ms. Remains : 756/1614 places, 726/1584 transitions.
[2024-05-28 13:49:12] [INFO ] Flatten gal took : 22 ms
[2024-05-28 13:49:12] [INFO ] Flatten gal took : 23 ms
[2024-05-28 13:49:12] [INFO ] Input system was already deterministic with 726 transitions.
[2024-05-28 13:49:12] [INFO ] Flatten gal took : 23 ms
[2024-05-28 13:49:13] [INFO ] Flatten gal took : 23 ms
[2024-05-28 13:49:13] [INFO ] Time to serialize gal into /tmp/CTLFireability10743206213241054604.gal : 3 ms
[2024-05-28 13:49:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7624761911362819785.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10743206213241054604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7624761911362819785.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:49:43] [INFO ] Flatten gal took : 29 ms
[2024-05-28 13:49:43] [INFO ] Applying decomposition
[2024-05-28 13:49:43] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph932179445719908822.txt' '-o' '/tmp/graph932179445719908822.bin' '-w' '/tmp/graph932179445719908822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph932179445719908822.bin' '-l' '-1' '-v' '-w' '/tmp/graph932179445719908822.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:49:43] [INFO ] Decomposing Gal with order
[2024-05-28 13:49:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:49:43] [INFO ] Removed a total of 482 redundant transitions.
[2024-05-28 13:49:43] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:49:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 446 labels/synchronizations in 25 ms.
[2024-05-28 13:49:43] [INFO ] Time to serialize gal into /tmp/CTLFireability5913115671933077278.gal : 5 ms
[2024-05-28 13:49:43] [INFO ] Time to serialize properties into /tmp/CTLFireability14398074728064595103.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5913115671933077278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14398074728064595103.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 1584/1584 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1600 transition count 1570
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1600 transition count 1570
Applied a total of 28 rules in 81 ms. Remains 1600 /1614 variables (removed 14) and now considering 1570/1584 (removed 14) transitions.
// Phase 1: matrix 1570 rows 1600 cols
[2024-05-28 13:50:13] [INFO ] Computed 271 invariants in 13 ms
[2024-05-28 13:50:13] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-28 13:50:13] [INFO ] Invariant cache hit.
[2024-05-28 13:50:15] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
Running 1569 sub problems to find dead transitions.
[2024-05-28 13:50:15] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1599/3170 variables, and 0 constraints, problems are : Problem set: 0 solved, 1569 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1600 constraints, PredecessorRefiner: 1569/1569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1569 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1599/3170 variables, and 0 constraints, problems are : Problem set: 0 solved, 1569 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1600 constraints, PredecessorRefiner: 0/1569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60388ms problems are : Problem set: 0 solved, 1569 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Starting structural reductions in LTL mode, iteration 1 : 1600/1614 places, 1570/1584 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62313 ms. Remains : 1600/1614 places, 1570/1584 transitions.
[2024-05-28 13:51:15] [INFO ] Flatten gal took : 31 ms
[2024-05-28 13:51:15] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:51:15] [INFO ] Input system was already deterministic with 1570 transitions.
[2024-05-28 13:51:15] [INFO ] Flatten gal took : 39 ms
[2024-05-28 13:51:15] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:51:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1433084563719242688.gal : 6 ms
[2024-05-28 13:51:15] [INFO ] Time to serialize properties into /tmp/CTLFireability8649260087463969755.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1433084563719242688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8649260087463969755.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:51:45] [INFO ] Flatten gal took : 36 ms
[2024-05-28 13:51:45] [INFO ] Applying decomposition
[2024-05-28 13:51:46] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2503595024599532910.txt' '-o' '/tmp/graph2503595024599532910.bin' '-w' '/tmp/graph2503595024599532910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2503595024599532910.bin' '-l' '-1' '-v' '-w' '/tmp/graph2503595024599532910.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:51:46] [INFO ] Decomposing Gal with order
[2024-05-28 13:51:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:51:46] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 13:51:46] [INFO ] Flatten gal took : 60 ms
[2024-05-28 13:51:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-28 13:51:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3623983434325278858.gal : 11 ms
[2024-05-28 13:51:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2883145135772689368.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3623983434325278858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2883145135772689368.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 1584/1584 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1592 transition count 1562
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1592 transition count 1562
Applied a total of 44 rules in 82 ms. Remains 1592 /1614 variables (removed 22) and now considering 1562/1584 (removed 22) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2024-05-28 13:52:16] [INFO ] Computed 271 invariants in 10 ms
[2024-05-28 13:52:16] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-28 13:52:16] [INFO ] Invariant cache hit.
[2024-05-28 13:52:18] [INFO ] Implicit Places using invariants and state equation in 1376 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-28 13:52:18] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1591/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1592 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1591/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1592 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60377ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60391ms
Starting structural reductions in LTL mode, iteration 1 : 1592/1614 places, 1562/1584 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62306 ms. Remains : 1592/1614 places, 1562/1584 transitions.
[2024-05-28 13:53:18] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:53:18] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:53:18] [INFO ] Input system was already deterministic with 1562 transitions.
[2024-05-28 13:53:18] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:53:18] [INFO ] Flatten gal took : 34 ms
[2024-05-28 13:53:18] [INFO ] Time to serialize gal into /tmp/CTLFireability4252599904310585698.gal : 7 ms
[2024-05-28 13:53:18] [INFO ] Time to serialize properties into /tmp/CTLFireability679509499681017744.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4252599904310585698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability679509499681017744.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:53:48] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:53:48] [INFO ] Applying decomposition
[2024-05-28 13:53:49] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8172759916027687876.txt' '-o' '/tmp/graph8172759916027687876.bin' '-w' '/tmp/graph8172759916027687876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8172759916027687876.bin' '-l' '-1' '-v' '-w' '/tmp/graph8172759916027687876.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:53:49] [INFO ] Decomposing Gal with order
[2024-05-28 13:53:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:53:49] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 13:53:49] [INFO ] Flatten gal took : 53 ms
[2024-05-28 13:53:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 13:53:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1863549548586591805.gal : 11 ms
[2024-05-28 13:53:49] [INFO ] Time to serialize properties into /tmp/CTLFireability11588742157354625348.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1863549548586591805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11588742157354625348.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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 : 1614/1614 places, 1584/1584 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 1613 transition count 1436
Reduce places removed 147 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 148 rules applied. Total rules applied 295 place count 1466 transition count 1435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 296 place count 1465 transition count 1435
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 152 Pre rules applied. Total rules applied 296 place count 1465 transition count 1283
Deduced a syphon composed of 152 places in 2 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 304 rules applied. Total rules applied 600 place count 1313 transition count 1283
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 622 place count 1291 transition count 1261
Iterating global reduction 3 with 22 rules applied. Total rules applied 644 place count 1291 transition count 1261
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 644 place count 1291 transition count 1252
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 662 place count 1282 transition count 1252
Performed 521 Post agglomeration using F-continuation condition.Transition count delta: 521
Deduced a syphon composed of 521 places in 1 ms
Reduce places removed 521 places and 0 transitions.
Iterating global reduction 3 with 1042 rules applied. Total rules applied 1704 place count 761 transition count 731
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1706 place count 759 transition count 729
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1707 place count 758 transition count 729
Applied a total of 1707 rules in 186 ms. Remains 758 /1614 variables (removed 856) and now considering 729/1584 (removed 855) transitions.
// Phase 1: matrix 729 rows 758 cols
[2024-05-28 13:54:19] [INFO ] Computed 270 invariants in 5 ms
[2024-05-28 13:54:19] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-28 13:54:19] [INFO ] Invariant cache hit.
[2024-05-28 13:54:20] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
[2024-05-28 13:54:20] [INFO ] Redundant transitions in 74 ms returned [728]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 723 sub problems to find dead transitions.
// Phase 1: matrix 728 rows 758 cols
[2024-05-28 13:54:20] [INFO ] Computed 270 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/754 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-05-28 13:54:28] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 3 ms to minimize.
[2024-05-28 13:54:28] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 4 ms to minimize.
[2024-05-28 13:54:28] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-28 13:54:28] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-28 13:54:28] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-28 13:54:28] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-28 13:54:28] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-28 13:54:28] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-05-28 13:54:28] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:54:28] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/754 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 13:54:30] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 13:54:30] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-28 13:54:30] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 13:54:30] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 13:54:30] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:54:30] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:54:32] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/754 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-05-28 13:54:32] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/754 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-05-28 13:54:44] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:54:46] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-28 13:54:46] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:54:46] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-28 13:54:46] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-28 13:54:49] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 13:54:49] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 13:54:49] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 13:54:50] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-28 13:54:50] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 754/1486 variables, and 266 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 187/270 constraints, State Equation: 0/758 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/754 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/754 variables, 79/266 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-05-28 13:54:51] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 13:54:52] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:54:53] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:54:53] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 2 ms to minimize.
[2024-05-28 13:54:57] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-28 13:55:00] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 13:55:00] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/754 variables, 18/284 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-05-28 13:55:01] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/754 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/754 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (OVERLAPS) 4/758 variables, 83/368 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-05-28 13:55:17] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:55:17] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:55:17] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:55:17] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/758 variables, 20/388 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-05-28 13:55:19] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 13:55:19] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 13:55:19] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 13:55:19] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:55:19] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 13:55:19] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:55:19] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:55:20] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:55:20] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-28 13:55:20] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:55:20] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 758/1486 variables, and 399 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/758 constraints, PredecessorRefiner: 0/723 constraints, Known Traps: 129/129 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in SI_CTL mode, iteration 1 : 758/1614 places, 728/1584 transitions.
Applied a total of 0 rules in 21 ms. Remains 758 /758 variables (removed 0) and now considering 728/728 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 61388 ms. Remains : 758/1614 places, 728/1584 transitions.
[2024-05-28 13:55:20] [INFO ] Flatten gal took : 19 ms
[2024-05-28 13:55:20] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:55:20] [INFO ] Input system was already deterministic with 728 transitions.
[2024-05-28 13:55:20] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:55:20] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:55:20] [INFO ] Time to serialize gal into /tmp/CTLFireability13260578893984894069.gal : 3 ms
[2024-05-28 13:55:20] [INFO ] Time to serialize properties into /tmp/CTLFireability8926666833534808501.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13260578893984894069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8926666833534808501.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:55:50] [INFO ] Flatten gal took : 27 ms
[2024-05-28 13:55:50] [INFO ] Applying decomposition
[2024-05-28 13:55:50] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13295860432584396409.txt' '-o' '/tmp/graph13295860432584396409.bin' '-w' '/tmp/graph13295860432584396409.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13295860432584396409.bin' '-l' '-1' '-v' '-w' '/tmp/graph13295860432584396409.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:55:51] [INFO ] Decomposing Gal with order
[2024-05-28 13:55:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:55:51] [INFO ] Removed a total of 483 redundant transitions.
[2024-05-28 13:55:51] [INFO ] Flatten gal took : 29 ms
[2024-05-28 13:55:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 448 labels/synchronizations in 8 ms.
[2024-05-28 13:55:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1853342755745354561.gal : 5 ms
[2024-05-28 13:55:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4650604603033890150.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1853342755745354561.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4650604603033890150.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 1584/1584 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1594 transition count 1564
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1594 transition count 1564
Applied a total of 40 rules in 85 ms. Remains 1594 /1614 variables (removed 20) and now considering 1564/1584 (removed 20) transitions.
// Phase 1: matrix 1564 rows 1594 cols
[2024-05-28 13:56:21] [INFO ] Computed 271 invariants in 15 ms
[2024-05-28 13:56:21] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-28 13:56:21] [INFO ] Invariant cache hit.
[2024-05-28 13:56:23] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-05-28 13:56:23] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1593/3158 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1594 constraints, PredecessorRefiner: 1563/1563 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1593/3158 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1594 constraints, PredecessorRefiner: 0/1563 constraints, Known Traps: 0/0 constraints]
After SMT, in 60363ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Starting structural reductions in LTL mode, iteration 1 : 1594/1614 places, 1564/1584 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62287 ms. Remains : 1594/1614 places, 1564/1584 transitions.
[2024-05-28 13:57:23] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:57:23] [INFO ] Flatten gal took : 34 ms
[2024-05-28 13:57:23] [INFO ] Input system was already deterministic with 1564 transitions.
[2024-05-28 13:57:23] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:57:23] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:57:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14460634032179349030.gal : 6 ms
[2024-05-28 13:57:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5113803040141510088.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14460634032179349030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5113803040141510088.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:57:53] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:57:53] [INFO ] Applying decomposition
[2024-05-28 13:57:53] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15281165366857856321.txt' '-o' '/tmp/graph15281165366857856321.bin' '-w' '/tmp/graph15281165366857856321.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15281165366857856321.bin' '-l' '-1' '-v' '-w' '/tmp/graph15281165366857856321.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:57:53] [INFO ] Decomposing Gal with order
[2024-05-28 13:57:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:57:53] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 13:57:53] [INFO ] Flatten gal took : 53 ms
[2024-05-28 13:57:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 13:57:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2855119245084286069.gal : 11 ms
[2024-05-28 13:57:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10452997594437828380.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2855119245084286069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10452997594437828380.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 1584/1584 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1592 transition count 1562
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1592 transition count 1562
Applied a total of 44 rules in 85 ms. Remains 1592 /1614 variables (removed 22) and now considering 1562/1584 (removed 22) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2024-05-28 13:58:24] [INFO ] Computed 271 invariants in 12 ms
[2024-05-28 13:58:24] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-28 13:58:24] [INFO ] Invariant cache hit.
[2024-05-28 13:58:25] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 1798 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-28 13:58:25] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1591/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1592 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1591/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1592 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60394ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Starting structural reductions in LTL mode, iteration 1 : 1592/1614 places, 1562/1584 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62292 ms. Remains : 1592/1614 places, 1562/1584 transitions.
[2024-05-28 13:59:26] [INFO ] Flatten gal took : 31 ms
[2024-05-28 13:59:26] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:59:26] [INFO ] Input system was already deterministic with 1562 transitions.
[2024-05-28 13:59:26] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:59:26] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:59:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5100651764729152972.gal : 6 ms
[2024-05-28 13:59:26] [INFO ] Time to serialize properties into /tmp/CTLFireability8011840711152642620.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5100651764729152972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8011840711152642620.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:59:56] [INFO ] Flatten gal took : 41 ms
[2024-05-28 13:59:56] [INFO ] Applying decomposition
[2024-05-28 13:59:56] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8557597756857531201.txt' '-o' '/tmp/graph8557597756857531201.bin' '-w' '/tmp/graph8557597756857531201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8557597756857531201.bin' '-l' '-1' '-v' '-w' '/tmp/graph8557597756857531201.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:59:56] [INFO ] Decomposing Gal with order
[2024-05-28 13:59:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:59:56] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 13:59:56] [INFO ] Flatten gal took : 51 ms
[2024-05-28 13:59:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 13:59:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11218474066613203957.gal : 11 ms
[2024-05-28 13:59:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13225403698916455069.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11218474066613203957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13225403698916455069.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 1584/1584 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1592 transition count 1562
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1592 transition count 1562
Applied a total of 44 rules in 83 ms. Remains 1592 /1614 variables (removed 22) and now considering 1562/1584 (removed 22) transitions.
[2024-05-28 14:00:27] [INFO ] Invariant cache hit.
[2024-05-28 14:00:27] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-28 14:00:27] [INFO ] Invariant cache hit.
[2024-05-28 14:00:28] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-28 14:00:28] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1591/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1592 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1591/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1592 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60365ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Starting structural reductions in LTL mode, iteration 1 : 1592/1614 places, 1562/1584 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62304 ms. Remains : 1592/1614 places, 1562/1584 transitions.
[2024-05-28 14:01:29] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:01:29] [INFO ] Flatten gal took : 33 ms
[2024-05-28 14:01:29] [INFO ] Input system was already deterministic with 1562 transitions.
[2024-05-28 14:01:29] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:01:29] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:01:29] [INFO ] Time to serialize gal into /tmp/CTLFireability782281041061295853.gal : 5 ms
[2024-05-28 14:01:29] [INFO ] Time to serialize properties into /tmp/CTLFireability14345497333025239805.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability782281041061295853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14345497333025239805.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:01:59] [INFO ] Flatten gal took : 39 ms
[2024-05-28 14:01:59] [INFO ] Applying decomposition
[2024-05-28 14:01:59] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13172772817383461547.txt' '-o' '/tmp/graph13172772817383461547.bin' '-w' '/tmp/graph13172772817383461547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13172772817383461547.bin' '-l' '-1' '-v' '-w' '/tmp/graph13172772817383461547.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:01:59] [INFO ] Decomposing Gal with order
[2024-05-28 14:01:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:01:59] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 14:01:59] [INFO ] Flatten gal took : 50 ms
[2024-05-28 14:01:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-28 14:01:59] [INFO ] Time to serialize gal into /tmp/CTLFireability13864005388694034439.gal : 10 ms
[2024-05-28 14:01:59] [INFO ] Time to serialize properties into /tmp/CTLFireability10010939547614907579.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13864005388694034439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10010939547614907579.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 1584/1584 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1595 transition count 1565
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1595 transition count 1565
Applied a total of 38 rules in 75 ms. Remains 1595 /1614 variables (removed 19) and now considering 1565/1584 (removed 19) transitions.
// Phase 1: matrix 1565 rows 1595 cols
[2024-05-28 14:02:30] [INFO ] Computed 271 invariants in 12 ms
[2024-05-28 14:02:30] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-28 14:02:30] [INFO ] Invariant cache hit.
[2024-05-28 14:02:31] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
Running 1564 sub problems to find dead transitions.
[2024-05-28 14:02:31] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1594/3160 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1595 constraints, PredecessorRefiner: 1564/1564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1594/3160 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1595 constraints, PredecessorRefiner: 0/1564 constraints, Known Traps: 0/0 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 1564 unsolved
Search for dead transitions found 0 dead transitions in 60365ms
Starting structural reductions in LTL mode, iteration 1 : 1595/1614 places, 1565/1584 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62233 ms. Remains : 1595/1614 places, 1565/1584 transitions.
[2024-05-28 14:03:32] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:03:32] [INFO ] Flatten gal took : 33 ms
[2024-05-28 14:03:32] [INFO ] Input system was already deterministic with 1565 transitions.
[2024-05-28 14:03:32] [INFO ] Flatten gal took : 33 ms
[2024-05-28 14:03:32] [INFO ] Flatten gal took : 33 ms
[2024-05-28 14:03:32] [INFO ] Time to serialize gal into /tmp/CTLFireability8615354250049668110.gal : 6 ms
[2024-05-28 14:03:32] [INFO ] Time to serialize properties into /tmp/CTLFireability3542914855323974498.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8615354250049668110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3542914855323974498.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:04:02] [INFO ] Flatten gal took : 35 ms
[2024-05-28 14:04:02] [INFO ] Applying decomposition
[2024-05-28 14:04:02] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2775824427230988812.txt' '-o' '/tmp/graph2775824427230988812.bin' '-w' '/tmp/graph2775824427230988812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2775824427230988812.bin' '-l' '-1' '-v' '-w' '/tmp/graph2775824427230988812.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:04:02] [INFO ] Decomposing Gal with order
[2024-05-28 14:04:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:04:02] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 14:04:02] [INFO ] Flatten gal took : 52 ms
[2024-05-28 14:04:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 14:04:02] [INFO ] Time to serialize gal into /tmp/CTLFireability4358059496220154095.gal : 11 ms
[2024-05-28 14:04:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16052786168944617417.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4358059496220154095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16052786168944617417.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 1584/1584 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1595 transition count 1565
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1595 transition count 1565
Applied a total of 38 rules in 76 ms. Remains 1595 /1614 variables (removed 19) and now considering 1565/1584 (removed 19) transitions.
// Phase 1: matrix 1565 rows 1595 cols
[2024-05-28 14:04:32] [INFO ] Computed 271 invariants in 12 ms
[2024-05-28 14:04:33] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-28 14:04:33] [INFO ] Invariant cache hit.
[2024-05-28 14:04:34] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
Running 1564 sub problems to find dead transitions.
[2024-05-28 14:04:34] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1594/3160 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1595 constraints, PredecessorRefiner: 1564/1564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1564 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1594/3160 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1595 constraints, PredecessorRefiner: 0/1564 constraints, Known Traps: 0/0 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 1564 unsolved
Search for dead transitions found 0 dead transitions in 60386ms
Starting structural reductions in LTL mode, iteration 1 : 1595/1614 places, 1565/1584 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62419 ms. Remains : 1595/1614 places, 1565/1584 transitions.
[2024-05-28 14:05:35] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:05:35] [INFO ] Flatten gal took : 34 ms
[2024-05-28 14:05:35] [INFO ] Input system was already deterministic with 1565 transitions.
[2024-05-28 14:05:35] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:05:35] [INFO ] Flatten gal took : 33 ms
[2024-05-28 14:05:35] [INFO ] Time to serialize gal into /tmp/CTLFireability1486074310607268981.gal : 5 ms
[2024-05-28 14:05:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11523387754751434156.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1486074310607268981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11523387754751434156.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:06:05] [INFO ] Flatten gal took : 33 ms
[2024-05-28 14:06:05] [INFO ] Applying decomposition
[2024-05-28 14:06:05] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1924646078794937747.txt' '-o' '/tmp/graph1924646078794937747.bin' '-w' '/tmp/graph1924646078794937747.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1924646078794937747.bin' '-l' '-1' '-v' '-w' '/tmp/graph1924646078794937747.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:06:05] [INFO ] Decomposing Gal with order
[2024-05-28 14:06:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:06:05] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 14:06:05] [INFO ] Flatten gal took : 51 ms
[2024-05-28 14:06:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 14:06:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15850010586646483072.gal : 10 ms
[2024-05-28 14:06:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14305114209204468159.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15850010586646483072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14305114209204468159.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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 : 1614/1614 places, 1584/1584 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 1613 transition count 1433
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 300 place count 1463 transition count 1433
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 300 place count 1463 transition count 1282
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 602 place count 1312 transition count 1282
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 624 place count 1290 transition count 1260
Iterating global reduction 2 with 22 rules applied. Total rules applied 646 place count 1290 transition count 1260
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 646 place count 1290 transition count 1251
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 664 place count 1281 transition count 1251
Performed 528 Post agglomeration using F-continuation condition.Transition count delta: 528
Deduced a syphon composed of 528 places in 1 ms
Reduce places removed 528 places and 0 transitions.
Iterating global reduction 2 with 1056 rules applied. Total rules applied 1720 place count 753 transition count 723
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1722 place count 751 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1723 place count 750 transition count 721
Applied a total of 1723 rules in 206 ms. Remains 750 /1614 variables (removed 864) and now considering 721/1584 (removed 863) transitions.
// Phase 1: matrix 721 rows 750 cols
[2024-05-28 14:06:36] [INFO ] Computed 270 invariants in 2 ms
[2024-05-28 14:06:36] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-28 14:06:36] [INFO ] Invariant cache hit.
[2024-05-28 14:06:37] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2024-05-28 14:06:37] [INFO ] Redundant transitions in 82 ms returned [720]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 718 sub problems to find dead transitions.
// Phase 1: matrix 720 rows 750 cols
[2024-05-28 14:06:37] [INFO ] Computed 270 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 269/269 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-05-28 14:06:45] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-05-28 14:06:45] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-28 14:06:45] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-28 14:06:45] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
[2024-05-28 14:06:45] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 3 ms to minimize.
[2024-05-28 14:06:45] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-05-28 14:06:45] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:06:45] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 3 ms to minimize.
[2024-05-28 14:06:46] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 14:06:46] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-28 14:06:46] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-28 14:06:46] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-28 14:06:46] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 14:06:46] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-28 14:06:46] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-28 14:06:46] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-28 14:06:46] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 20/289 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 14:06:47] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 20/309 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-05-28 14:06:49] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 14:06:49] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 14:06:49] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 14:06:49] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 14:06:49] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 14:06:49] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:06:49] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:06:50] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:06:50] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:06:50] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:06:50] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:06:50] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:06:50] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-28 14:06:50] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:06:51] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-28 14:06:51] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 14:06:51] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-28 14:06:51] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-28 14:06:51] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-28 14:06:51] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/749 variables, 20/329 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-05-28 14:06:59] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 14:06:59] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-28 14:06:59] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:07:00] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:07:01] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-28 14:07:01] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 14:07:01] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-28 14:07:01] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:07:01] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 4 ms to minimize.
[2024-05-28 14:07:02] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 3 ms to minimize.
[2024-05-28 14:07:02] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:07:02] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:07:02] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 3 ms to minimize.
[2024-05-28 14:07:02] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 3 ms to minimize.
[2024-05-28 14:07:03] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:07:03] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 3 ms to minimize.
[2024-05-28 14:07:03] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 2 ms to minimize.
[2024-05-28 14:07:03] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
[2024-05-28 14:07:03] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:07:04] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/749 variables, 20/349 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-05-28 14:07:05] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2024-05-28 14:07:06] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-28 14:07:06] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-28 14:07:07] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 2 ms to minimize.
SMT process timed out in 30173ms, After SMT, problems are : Problem set: 0 solved, 718 unsolved
Search for dead transitions found 0 dead transitions in 30179ms
Starting structural reductions in SI_CTL mode, iteration 1 : 750/1614 places, 720/1584 transitions.
Applied a total of 0 rules in 13 ms. Remains 750 /750 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 31490 ms. Remains : 750/1614 places, 720/1584 transitions.
[2024-05-28 14:07:07] [INFO ] Flatten gal took : 19 ms
[2024-05-28 14:07:07] [INFO ] Flatten gal took : 21 ms
[2024-05-28 14:07:07] [INFO ] Input system was already deterministic with 720 transitions.
[2024-05-28 14:07:07] [INFO ] Flatten gal took : 20 ms
[2024-05-28 14:07:07] [INFO ] Flatten gal took : 21 ms
[2024-05-28 14:07:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10186752948485867080.gal : 3 ms
[2024-05-28 14:07:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10095048080912035031.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10186752948485867080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10095048080912035031.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:07:37] [INFO ] Flatten gal took : 20 ms
[2024-05-28 14:07:37] [INFO ] Applying decomposition
[2024-05-28 14:07:37] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9542168783214935584.txt' '-o' '/tmp/graph9542168783214935584.bin' '-w' '/tmp/graph9542168783214935584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9542168783214935584.bin' '-l' '-1' '-v' '-w' '/tmp/graph9542168783214935584.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:07:37] [INFO ] Decomposing Gal with order
[2024-05-28 14:07:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:07:37] [INFO ] Removed a total of 477 redundant transitions.
[2024-05-28 14:07:37] [INFO ] Flatten gal took : 29 ms
[2024-05-28 14:07:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 454 labels/synchronizations in 15 ms.
[2024-05-28 14:07:37] [INFO ] Time to serialize gal into /tmp/CTLFireability8212663901860413840.gal : 7 ms
[2024-05-28 14:07:37] [INFO ] Time to serialize properties into /tmp/CTLFireability1715783061226863830.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8212663901860413840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1715783061226863830.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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 : 1614/1614 places, 1584/1584 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 1613 transition count 1432
Reduce places removed 151 places and 0 transitions.
Iterating post reduction 1 with 151 rules applied. Total rules applied 302 place count 1462 transition count 1432
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 302 place count 1462 transition count 1281
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 604 place count 1311 transition count 1281
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 625 place count 1290 transition count 1260
Iterating global reduction 2 with 21 rules applied. Total rules applied 646 place count 1290 transition count 1260
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 646 place count 1290 transition count 1251
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 664 place count 1281 transition count 1251
Performed 528 Post agglomeration using F-continuation condition.Transition count delta: 528
Deduced a syphon composed of 528 places in 2 ms
Reduce places removed 528 places and 0 transitions.
Iterating global reduction 2 with 1056 rules applied. Total rules applied 1720 place count 753 transition count 723
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1722 place count 751 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1723 place count 750 transition count 721
Applied a total of 1723 rules in 165 ms. Remains 750 /1614 variables (removed 864) and now considering 721/1584 (removed 863) transitions.
// Phase 1: matrix 721 rows 750 cols
[2024-05-28 14:08:08] [INFO ] Computed 270 invariants in 1 ms
[2024-05-28 14:08:08] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-28 14:08:08] [INFO ] Invariant cache hit.
[2024-05-28 14:08:08] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2024-05-28 14:08:09] [INFO ] Redundant transitions in 122 ms returned [720]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 719 sub problems to find dead transitions.
// Phase 1: matrix 720 rows 750 cols
[2024-05-28 14:08:09] [INFO ] Computed 270 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 270/270 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-28 14:08:16] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 3 ms to minimize.
[2024-05-28 14:08:17] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
[2024-05-28 14:08:17] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 3 ms to minimize.
[2024-05-28 14:08:17] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-05-28 14:08:17] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
[2024-05-28 14:08:17] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:08:17] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:08:17] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 3 ms to minimize.
[2024-05-28 14:08:17] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:08:18] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:08:18] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:08:18] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-28 14:08:18] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-28 14:08:18] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-28 14:08:18] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-05-28 14:08:18] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-28 14:08:18] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-28 14:08:18] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-28 14:08:18] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/750 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 14:08:20] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 14:08:20] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 14:08:20] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 14:08:20] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:08:20] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 14:08:20] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/750 variables, 20/310 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-28 14:08:20] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 14:08:20] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 14:08:21] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:08:21] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:08:21] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:08:21] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-28 14:08:21] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:08:22] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:08:22] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-28 14:08:22] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-28 14:08:22] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-28 14:08:22] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:08:22] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-28 14:08:22] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:08:24] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 20/330 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-28 14:08:31] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 14:08:32] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:08:32] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 14:08:32] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:08:32] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:08:33] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-28 14:08:33] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-28 14:08:34] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:08:34] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-28 14:08:34] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:08:34] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:08:34] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:08:35] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-05-28 14:08:35] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:08:35] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 3 ms to minimize.
[2024-05-28 14:08:35] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 3 ms to minimize.
[2024-05-28 14:08:36] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 3 ms to minimize.
[2024-05-28 14:08:36] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-05-28 14:08:36] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
[2024-05-28 14:08:36] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-28 14:08:37] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:08:37] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/1470 variables, and 352 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 270/270 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/750 variables, 82/352 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-28 14:08:40] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:08:40] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:08:41] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-28 14:08:41] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-28 14:08:42] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:08:43] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 3 ms to minimize.
[2024-05-28 14:08:45] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 14:08:45] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 14:08:45] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 14:08:45] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 14:08:45] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 14:08:45] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 14:08:46] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 14:08:46] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 14:08:46] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 14:08:46] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 14:08:46] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 14:08:47] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 14:08:47] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 14:08:47] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/750 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-28 14:08:47] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 14:08:47] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 14:08:48] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:08:48] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:08:48] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:08:48] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:08:50] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2024-05-28 14:08:50] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 3 ms to minimize.
[2024-05-28 14:08:51] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:08:55] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 2 ms to minimize.
[2024-05-28 14:08:55] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 14:08:55] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 14:08:55] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 14:08:55] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 14:08:56] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 14:08:56] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 14:08:56] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 14:08:56] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 14:08:56] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 14:08:57] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-28 14:08:58] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-28 14:08:58] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-28 14:08:59] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-28 14:08:59] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:09:00] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:09:06] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 14:09:06] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 14:09:06] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 14:09:06] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 14:09:06] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 14:09:07] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 11/403 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-28 14:09:08] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-28 14:09:08] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 1)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 1)
(s232 1)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 1)
(s259 0)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 0)
(s285 1)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 1)
(s334 0)
(s335 1)
(s336 0)
(s337 1)
(s338 0)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 1)
(s357 0)
(s358 1)
(s359 0)
(s360 1)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 1)
(s381 0)
(s382 1)
(s383 0)
(s384 0)
(s385 1)
(s386 0)
(s387 1)
(s388 0)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 1)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 1)
(s409 0)
(s410 1)
(s411 0)
(s412 1)
(s413 0)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 1)
(s429 0)
(s430 1)
(s431 0)
(s432 0)
(s433 1)
(s434 0)
(s435 1)
(s436 0)
(s437 1)
(s438 0)
(s439 0)
(s440 1)
(s441 0)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 1)
(s457 0)
(s458 1)
(s459 0)
(s460 1)
(s461 0)
(s462 1)
(s463 0)
(s464 0)
(s465 0)
(s466 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/1470 variables, and 405 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/750 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 135/135 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in SI_CTL mode, iteration 1 : 750/1614 places, 720/1584 transitions.
Applied a total of 0 rules in 12 ms. Remains 750 /750 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 61392 ms. Remains : 750/1614 places, 720/1584 transitions.
[2024-05-28 14:09:09] [INFO ] Flatten gal took : 19 ms
[2024-05-28 14:09:09] [INFO ] Flatten gal took : 20 ms
[2024-05-28 14:09:09] [INFO ] Input system was already deterministic with 720 transitions.
[2024-05-28 14:09:09] [INFO ] Flatten gal took : 22 ms
[2024-05-28 14:09:09] [INFO ] Flatten gal took : 20 ms
[2024-05-28 14:09:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1451459068809019175.gal : 3 ms
[2024-05-28 14:09:09] [INFO ] Time to serialize properties into /tmp/CTLFireability8317319360929600292.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1451459068809019175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8317319360929600292.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:09:39] [INFO ] Flatten gal took : 24 ms
[2024-05-28 14:09:39] [INFO ] Applying decomposition
[2024-05-28 14:09:39] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9110275397520769344.txt' '-o' '/tmp/graph9110275397520769344.bin' '-w' '/tmp/graph9110275397520769344.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9110275397520769344.bin' '-l' '-1' '-v' '-w' '/tmp/graph9110275397520769344.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:09:39] [INFO ] Decomposing Gal with order
[2024-05-28 14:09:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:09:39] [INFO ] Removed a total of 475 redundant transitions.
[2024-05-28 14:09:39] [INFO ] Flatten gal took : 29 ms
[2024-05-28 14:09:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 456 labels/synchronizations in 4 ms.
[2024-05-28 14:09:39] [INFO ] Time to serialize gal into /tmp/CTLFireability16016243556173260594.gal : 4 ms
[2024-05-28 14:09:39] [INFO ] Time to serialize properties into /tmp/CTLFireability15968610669827205996.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16016243556173260594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15968610669827205996.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:10:09] [INFO ] Flatten gal took : 34 ms
[2024-05-28 14:10:09] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:10:09] [INFO ] Applying decomposition
[2024-05-28 14:10:09] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3488882969046892349.txt' '-o' '/tmp/graph3488882969046892349.bin' '-w' '/tmp/graph3488882969046892349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3488882969046892349.bin' '-l' '-1' '-v' '-w' '/tmp/graph3488882969046892349.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:10:09] [INFO ] Decomposing Gal with order
[2024-05-28 14:10:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:10:10] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 14:10:10] [INFO ] Flatten gal took : 53 ms
[2024-05-28 14:10:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 14:10:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4297577756948002520.gal : 11 ms
[2024-05-28 14:10:10] [INFO ] Time to serialize properties into /tmp/CTLFireability2446401751596296358.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4297577756948002520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2446401751596296358.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 14:18:55] [INFO ] Applying decomposition
[2024-05-28 14:18:56] [INFO ] Flatten gal took : 36 ms
[2024-05-28 14:18:56] [INFO ] Decomposing Gal with order
[2024-05-28 14:18:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:18:56] [INFO ] Removed a total of 480 redundant transitions.
[2024-05-28 14:18:56] [INFO ] Flatten gal took : 53 ms
[2024-05-28 14:18:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 15 ms.
[2024-05-28 14:18:56] [INFO ] Time to serialize gal into /tmp/CTLFireability1570264709323846517.gal : 12 ms
[2024-05-28 14:18:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13408118057803583875.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1570264709323846517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13408118057803583875.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 14:26:04] [INFO ] Flatten gal took : 41 ms
[2024-05-28 14:26:04] [INFO ] Input system was already deterministic with 1584 transitions.
[2024-05-28 14:26:04] [INFO ] Transformed 1614 places.
[2024-05-28 14:26:04] [INFO ] Transformed 1584 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 14:26:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16697537506887225754.gal : 6 ms
[2024-05-28 14:26:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7037999358144643860.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16697537506887225754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7037999358144643860.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-030B"
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-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-030B, 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 r356-tall-171683760400122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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