fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r070-tall-171620505200125
Last Updated
July 7, 2024

About the Execution of ITS-Tools for CANInsertWithFailure-PT-040

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12812.191 3600000.00 4784176.00 7836.20 ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505200125.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 CANInsertWithFailure-PT-040, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505200125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.8M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716246730134

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-20 23:12:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 23:12:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:12:11] [INFO ] Load time of PNML (sax parser for PT used): 358 ms
[2024-05-20 23:12:11] [INFO ] Transformed 3684 places.
[2024-05-20 23:12:11] [INFO ] Transformed 9840 transitions.
[2024-05-20 23:12:11] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 496 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 9840 rows 3684 cols
[2024-05-20 23:12:12] [INFO ] Computed 43 invariants in 572 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1]
RANDOM walk for 10000 steps (9 resets) in 133 ms. (74 steps per ms)
FORMULA CANInsertWithFailure-PT-040-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150015 steps (30 resets) in 200 ms. (746 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 0, 1, 0, 0, 0, 0, 2, 1, 0, 1, 1, 0] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
[2024-05-20 23:12:12] [INFO ] Invariant cache hit.
[2024-05-20 23:12:13] [INFO ] [Real]Absence check using 41 positive place invariants in 76 ms returned sat
[2024-05-20 23:12:13] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-20 23:12:15] [INFO ] [Real]Absence check using state equation in 2390 ms returned sat
[2024-05-20 23:12:16] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:12:16] [INFO ] [Real]Added 3160 Read/Feed constraints in 301 ms returned sat
[2024-05-20 23:12:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:12:17] [INFO ] [Nat]Absence check using 41 positive place invariants in 64 ms returned sat
[2024-05-20 23:12:17] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:12:19] [INFO ] [Nat]Absence check using state equation in 2408 ms returned sat
[2024-05-20 23:12:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:12:20] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1169 ms returned unknown
[2024-05-20 23:12:21] [INFO ] [Real]Absence check using 41 positive place invariants in 72 ms returned sat
[2024-05-20 23:12:21] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:12:23] [INFO ] [Real]Absence check using state equation in 2401 ms returned sat
[2024-05-20 23:12:24] [INFO ] [Real]Added 3160 Read/Feed constraints in 277 ms returned sat
[2024-05-20 23:12:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:12:24] [INFO ] [Nat]Absence check using 41 positive place invariants in 58 ms returned sat
[2024-05-20 23:12:24] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:12:27] [INFO ] [Nat]Absence check using state equation in 2428 ms returned sat
[2024-05-20 23:12:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:12:28] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1146 ms returned unknown
[2024-05-20 23:12:28] [INFO ] [Real]Absence check using 41 positive place invariants in 55 ms returned sat
[2024-05-20 23:12:28] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:12:31] [INFO ] [Real]Absence check using state equation in 2275 ms returned sat
[2024-05-20 23:12:31] [INFO ] [Real]Added 3160 Read/Feed constraints in 252 ms returned sat
[2024-05-20 23:12:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:12:32] [INFO ] [Nat]Absence check using 41 positive place invariants in 60 ms returned sat
[2024-05-20 23:12:32] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:12:34] [INFO ] [Nat]Absence check using state equation in 2371 ms returned sat
[2024-05-20 23:12:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:12:35] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1152 ms returned unknown
[2024-05-20 23:12:36] [INFO ] [Real]Absence check using 41 positive place invariants in 58 ms returned sat
[2024-05-20 23:12:36] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:12:38] [INFO ] [Real]Absence check using state equation in 2410 ms returned sat
[2024-05-20 23:12:39] [INFO ] [Real]Added 3160 Read/Feed constraints in 265 ms returned sat
[2024-05-20 23:12:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:12:39] [INFO ] [Nat]Absence check using 41 positive place invariants in 58 ms returned sat
[2024-05-20 23:12:39] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:12:41] [INFO ] [Nat]Absence check using state equation in 2323 ms returned sat
[2024-05-20 23:12:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:12:43] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1152 ms returned unknown
[2024-05-20 23:12:43] [INFO ] [Real]Absence check using 41 positive place invariants in 54 ms returned sat
[2024-05-20 23:12:43] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:12:45] [INFO ] [Real]Absence check using state equation in 2312 ms returned sat
[2024-05-20 23:12:46] [INFO ] [Real]Added 3160 Read/Feed constraints in 258 ms returned sat
[2024-05-20 23:12:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:12:46] [INFO ] [Nat]Absence check using 41 positive place invariants in 54 ms returned sat
[2024-05-20 23:12:46] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-20 23:12:49] [INFO ] [Nat]Absence check using state equation in 2205 ms returned sat
[2024-05-20 23:12:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:12:50] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1150 ms returned unknown
[2024-05-20 23:12:50] [INFO ] [Real]Absence check using 41 positive place invariants in 53 ms returned sat
[2024-05-20 23:12:50] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 35 ms returned sat
[2024-05-20 23:12:53] [INFO ] [Real]Absence check using state equation in 2302 ms returned sat
[2024-05-20 23:12:53] [INFO ] [Real]Added 3160 Read/Feed constraints in 257 ms returned sat
[2024-05-20 23:12:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:12:54] [INFO ] [Nat]Absence check using 41 positive place invariants in 63 ms returned sat
[2024-05-20 23:12:54] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 27 ms returned sat
[2024-05-20 23:12:56] [INFO ] [Nat]Absence check using state equation in 2336 ms returned sat
[2024-05-20 23:12:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:12:57] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1152 ms returned unknown
[2024-05-20 23:12:58] [INFO ] [Real]Absence check using 41 positive place invariants in 56 ms returned sat
[2024-05-20 23:12:58] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:13:00] [INFO ] [Real]Absence check using state equation in 2259 ms returned sat
[2024-05-20 23:13:00] [INFO ] [Real]Added 3160 Read/Feed constraints in 261 ms returned sat
[2024-05-20 23:13:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:13:01] [INFO ] [Nat]Absence check using 41 positive place invariants in 57 ms returned sat
[2024-05-20 23:13:01] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:13:03] [INFO ] [Nat]Absence check using state equation in 2290 ms returned sat
[2024-05-20 23:13:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:13:04] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1140 ms returned unknown
[2024-05-20 23:13:05] [INFO ] [Real]Absence check using 41 positive place invariants in 53 ms returned sat
[2024-05-20 23:13:05] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-20 23:13:07] [INFO ] [Real]Absence check using state equation in 2172 ms returned sat
[2024-05-20 23:13:07] [INFO ] [Real]Added 3160 Read/Feed constraints in 247 ms returned sat
[2024-05-20 23:13:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:13:08] [INFO ] [Nat]Absence check using 41 positive place invariants in 54 ms returned sat
[2024-05-20 23:13:08] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:13:10] [INFO ] [Nat]Absence check using state equation in 2245 ms returned sat
[2024-05-20 23:13:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:13:11] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1146 ms returned unknown
[2024-05-20 23:13:12] [INFO ] [Real]Absence check using 41 positive place invariants in 53 ms returned sat
[2024-05-20 23:13:12] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:13:14] [INFO ] [Real]Absence check using state equation in 2239 ms returned sat
[2024-05-20 23:13:14] [INFO ] [Real]Added 3160 Read/Feed constraints in 243 ms returned sat
[2024-05-20 23:13:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:13:15] [INFO ] [Nat]Absence check using 41 positive place invariants in 56 ms returned sat
[2024-05-20 23:13:15] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-20 23:13:17] [INFO ] [Nat]Absence check using state equation in 2302 ms returned sat
[2024-05-20 23:13:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:13:18] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1150 ms returned unknown
[2024-05-20 23:13:19] [INFO ] [Real]Absence check using 41 positive place invariants in 53 ms returned sat
[2024-05-20 23:13:19] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:13:21] [INFO ] [Real]Absence check using state equation in 2294 ms returned sat
[2024-05-20 23:13:22] [INFO ] [Real]Added 3160 Read/Feed constraints in 227 ms returned sat
[2024-05-20 23:13:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:13:22] [INFO ] [Nat]Absence check using 41 positive place invariants in 55 ms returned sat
[2024-05-20 23:13:22] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:13:25] [INFO ] [Nat]Absence check using state equation in 2312 ms returned sat
[2024-05-20 23:13:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:13:26] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1150 ms returned unknown
[2024-05-20 23:13:26] [INFO ] [Real]Absence check using 41 positive place invariants in 52 ms returned sat
[2024-05-20 23:13:26] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-20 23:13:28] [INFO ] [Real]Absence check using state equation in 2195 ms returned sat
[2024-05-20 23:13:29] [INFO ] [Real]Added 3160 Read/Feed constraints in 260 ms returned sat
[2024-05-20 23:13:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:13:29] [INFO ] [Nat]Absence check using 41 positive place invariants in 54 ms returned sat
[2024-05-20 23:13:29] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 35 ms returned sat
[2024-05-20 23:13:32] [INFO ] [Nat]Absence check using state equation in 2207 ms returned sat
[2024-05-20 23:13:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:13:33] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1143 ms returned unknown
[2024-05-20 23:13:33] [INFO ] [Real]Absence check using 41 positive place invariants in 52 ms returned sat
[2024-05-20 23:13:33] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 27 ms returned sat
[2024-05-20 23:13:35] [INFO ] [Real]Absence check using state equation in 2310 ms returned sat
[2024-05-20 23:13:36] [INFO ] [Real]Added 3160 Read/Feed constraints in 228 ms returned sat
[2024-05-20 23:13:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:13:36] [INFO ] [Nat]Absence check using 41 positive place invariants in 53 ms returned sat
[2024-05-20 23:13:36] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 25 ms returned sat
[2024-05-20 23:13:39] [INFO ] [Nat]Absence check using state equation in 2318 ms returned sat
[2024-05-20 23:13:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:13:40] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1150 ms returned unknown
[2024-05-20 23:13:40] [INFO ] [Real]Absence check using 41 positive place invariants in 52 ms returned sat
[2024-05-20 23:13:40] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 26 ms returned sat
[2024-05-20 23:13:43] [INFO ] [Real]Absence check using state equation in 2233 ms returned sat
[2024-05-20 23:13:43] [INFO ] [Real]Added 3160 Read/Feed constraints in 265 ms returned sat
[2024-05-20 23:13:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:13:44] [INFO ] [Nat]Absence check using 41 positive place invariants in 52 ms returned sat
[2024-05-20 23:13:44] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 26 ms returned sat
[2024-05-20 23:13:46] [INFO ] [Nat]Absence check using state equation in 2281 ms returned sat
[2024-05-20 23:13:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:13:47] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1139 ms returned unknown
[2024-05-20 23:13:47] [INFO ] [Real]Absence check using 41 positive place invariants in 61 ms returned sat
[2024-05-20 23:13:47] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 26 ms returned sat
[2024-05-20 23:13:50] [INFO ] [Real]Absence check using state equation in 2225 ms returned sat
[2024-05-20 23:13:50] [INFO ] [Real]Added 3160 Read/Feed constraints in 253 ms returned sat
[2024-05-20 23:13:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:13:51] [INFO ] [Nat]Absence check using 41 positive place invariants in 64 ms returned sat
[2024-05-20 23:13:51] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 26 ms returned sat
[2024-05-20 23:13:53] [INFO ] [Nat]Absence check using state equation in 2261 ms returned sat
[2024-05-20 23:13:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:13:54] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1145 ms returned unknown
[2024-05-20 23:13:54] [INFO ] [Real]Absence check using 41 positive place invariants in 52 ms returned sat
[2024-05-20 23:13:54] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 26 ms returned sat
[2024-05-20 23:13:57] [INFO ] [Real]Absence check using state equation in 2245 ms returned sat
[2024-05-20 23:13:57] [INFO ] [Real]Added 3160 Read/Feed constraints in 259 ms returned sat
[2024-05-20 23:13:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:13:58] [INFO ] [Nat]Absence check using 41 positive place invariants in 53 ms returned sat
[2024-05-20 23:13:58] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 27 ms returned sat
[2024-05-20 23:14:00] [INFO ] [Nat]Absence check using state equation in 2276 ms returned sat
[2024-05-20 23:14:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 23:14:01] [INFO ] [Nat]Added 3160 Read/Feed constraints in 1143 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 0, 1, 0, 0, 0, 0, 2, 1, 0, 1, 1, 0] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 0, 1, 0, 0, 0, 0, 2, 1, 0, 1, 1, 0] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
Support contains 15 out of 3684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Graph (complete) has 13401 edges and 3684 vertex of which 3683 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.24 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 280 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3404 transition count 9560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 561 place count 3403 transition count 9560
Performed 1478 Post agglomeration using F-continuation condition.Transition count delta: 1478
Deduced a syphon composed of 1478 places in 3 ms
Reduce places removed 1478 places and 0 transitions.
Iterating global reduction 3 with 2956 rules applied. Total rules applied 3517 place count 1925 transition count 8082
Drop transitions (Redundant composition of simpler transitions.) removed 1401 transitions
Redundant transition composition rules discarded 1401 transitions
Iterating global reduction 3 with 1401 rules applied. Total rules applied 4918 place count 1925 transition count 6681
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4920 place count 1925 transition count 6679
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4922 place count 1923 transition count 6679
Partial Free-agglomeration rule applied 1708 times.
Drop transitions (Partial Free agglomeration) removed 1708 transitions
Iterating global reduction 4 with 1708 rules applied. Total rules applied 6630 place count 1923 transition count 6679
Applied a total of 6630 rules in 2124 ms. Remains 1923 /3684 variables (removed 1761) and now considering 6679/9840 (removed 3161) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2142 ms. Remains : 1923/3684 places, 6679/9840 transitions.
// Phase 1: matrix 6679 rows 1923 cols
[2024-05-20 23:14:04] [INFO ] Computed 42 invariants in 291 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 0, 1, 0, 0, 0, 0, 2, 1, 0, 1, 1, 0] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
RANDOM walk for 1000000 steps (5101 resets) in 11080 ms. (90 steps per ms)
BEST_FIRST walk for 15000015 steps (1506 resets) in 18949 ms. (791 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
[2024-05-20 23:14:34] [INFO ] Invariant cache hit.
[2024-05-20 23:14:34] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:14:34] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:14:35] [INFO ] [Real]Absence check using state equation in 1238 ms returned sat
[2024-05-20 23:14:35] [INFO ] State equation strengthened by 6344 read => feed constraints.
[2024-05-20 23:14:36] [INFO ] [Real]Added 6344 Read/Feed constraints in 460 ms returned sat
[2024-05-20 23:14:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:14:36] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:14:36] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:14:37] [INFO ] [Nat]Absence check using state equation in 1263 ms returned sat
[2024-05-20 23:14:38] [INFO ] [Nat]Added 6344 Read/Feed constraints in 617 ms returned sat
[2024-05-20 23:14:39] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 411 ms.
[2024-05-20 23:14:40] [INFO ] Added : 9 causal constraints over 2 iterations in 1303 ms. Result :sat
Minimization took 5161 ms.
[2024-05-20 23:14:45] [INFO ] [Real]Absence check using 40 positive place invariants in 34 ms returned sat
[2024-05-20 23:14:45] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:14:46] [INFO ] [Real]Absence check using state equation in 1258 ms returned sat
[2024-05-20 23:14:47] [INFO ] [Real]Added 6344 Read/Feed constraints in 488 ms returned sat
[2024-05-20 23:14:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:14:47] [INFO ] [Nat]Absence check using 40 positive place invariants in 40 ms returned sat
[2024-05-20 23:14:47] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:14:48] [INFO ] [Nat]Absence check using state equation in 1270 ms returned sat
[2024-05-20 23:14:49] [INFO ] [Nat]Added 6344 Read/Feed constraints in 652 ms returned sat
[2024-05-20 23:14:50] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 419 ms.
[2024-05-20 23:14:50] [INFO ] Added : 5 causal constraints over 1 iterations in 1026 ms. Result :sat
Minimization took 5157 ms.
[2024-05-20 23:14:56] [INFO ] [Real]Absence check using 40 positive place invariants in 30 ms returned sat
[2024-05-20 23:14:56] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:14:57] [INFO ] [Real]Absence check using state equation in 1282 ms returned sat
[2024-05-20 23:14:58] [INFO ] [Real]Added 6344 Read/Feed constraints in 498 ms returned sat
[2024-05-20 23:14:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:14:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:14:58] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:14:59] [INFO ] [Nat]Absence check using state equation in 1276 ms returned sat
[2024-05-20 23:15:00] [INFO ] [Nat]Added 6344 Read/Feed constraints in 596 ms returned sat
[2024-05-20 23:15:00] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 332 ms.
[2024-05-20 23:15:01] [INFO ] Added : 9 causal constraints over 2 iterations in 1164 ms. Result :sat
Minimization took 5149 ms.
[2024-05-20 23:15:06] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:15:06] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:15:08] [INFO ] [Real]Absence check using state equation in 1213 ms returned sat
[2024-05-20 23:15:08] [INFO ] [Real]Added 6344 Read/Feed constraints in 504 ms returned sat
[2024-05-20 23:15:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:15:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:15:09] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:15:10] [INFO ] [Nat]Absence check using state equation in 1268 ms returned sat
[2024-05-20 23:15:11] [INFO ] [Nat]Added 6344 Read/Feed constraints in 579 ms returned sat
[2024-05-20 23:15:11] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 329 ms.
[2024-05-20 23:15:12] [INFO ] Added : 7 causal constraints over 2 iterations in 1150 ms. Result :sat
Minimization took 5155 ms.
[2024-05-20 23:15:17] [INFO ] [Real]Absence check using 40 positive place invariants in 31 ms returned sat
[2024-05-20 23:15:17] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:15:18] [INFO ] [Real]Absence check using state equation in 1275 ms returned sat
[2024-05-20 23:15:19] [INFO ] [Real]Added 6344 Read/Feed constraints in 490 ms returned sat
[2024-05-20 23:15:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:15:19] [INFO ] [Nat]Absence check using 40 positive place invariants in 30 ms returned sat
[2024-05-20 23:15:19] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:15:21] [INFO ] [Nat]Absence check using state equation in 1274 ms returned sat
[2024-05-20 23:15:21] [INFO ] [Nat]Added 6344 Read/Feed constraints in 579 ms returned sat
[2024-05-20 23:15:22] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 335 ms.
[2024-05-20 23:15:23] [INFO ] Added : 9 causal constraints over 2 iterations in 1141 ms. Result :sat
Minimization took 5154 ms.
[2024-05-20 23:15:28] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:15:28] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:15:29] [INFO ] [Real]Absence check using state equation in 1268 ms returned sat
[2024-05-20 23:15:30] [INFO ] [Real]Added 6344 Read/Feed constraints in 508 ms returned sat
[2024-05-20 23:15:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:15:30] [INFO ] [Nat]Absence check using 40 positive place invariants in 30 ms returned sat
[2024-05-20 23:15:30] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:15:32] [INFO ] [Nat]Absence check using state equation in 1272 ms returned sat
[2024-05-20 23:15:32] [INFO ] [Nat]Added 6344 Read/Feed constraints in 617 ms returned sat
[2024-05-20 23:15:33] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 321 ms.
[2024-05-20 23:15:33] [INFO ] Added : 10 causal constraints over 2 iterations in 1151 ms. Result :sat
Minimization took 5160 ms.
[2024-05-20 23:15:39] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:15:39] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:15:40] [INFO ] [Real]Absence check using state equation in 1221 ms returned sat
[2024-05-20 23:15:41] [INFO ] [Real]Added 6344 Read/Feed constraints in 450 ms returned sat
[2024-05-20 23:15:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:15:41] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:15:41] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:15:42] [INFO ] [Nat]Absence check using state equation in 1226 ms returned sat
[2024-05-20 23:15:43] [INFO ] [Nat]Added 6344 Read/Feed constraints in 558 ms returned sat
[2024-05-20 23:15:43] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 330 ms.
[2024-05-20 23:15:44] [INFO ] Added : 7 causal constraints over 2 iterations in 1147 ms. Result :sat
Minimization took 5152 ms.
[2024-05-20 23:15:49] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:15:49] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:15:51] [INFO ] [Real]Absence check using state equation in 1244 ms returned sat
[2024-05-20 23:15:51] [INFO ] [Real]Added 6344 Read/Feed constraints in 459 ms returned sat
[2024-05-20 23:15:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:15:52] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:15:52] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:15:53] [INFO ] [Nat]Absence check using state equation in 1251 ms returned sat
[2024-05-20 23:15:54] [INFO ] [Nat]Added 6344 Read/Feed constraints in 622 ms returned sat
[2024-05-20 23:15:54] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 327 ms.
[2024-05-20 23:15:55] [INFO ] Added : 10 causal constraints over 2 iterations in 1233 ms. Result :sat
Minimization took 5145 ms.
[2024-05-20 23:16:00] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:16:00] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 27 ms returned sat
[2024-05-20 23:16:02] [INFO ] [Real]Absence check using state equation in 1236 ms returned sat
[2024-05-20 23:16:02] [INFO ] [Real]Added 6344 Read/Feed constraints in 483 ms returned sat
[2024-05-20 23:16:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:16:02] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:16:03] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:16:04] [INFO ] [Nat]Absence check using state equation in 1241 ms returned sat
[2024-05-20 23:16:04] [INFO ] [Nat]Added 6344 Read/Feed constraints in 580 ms returned sat
[2024-05-20 23:16:05] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 329 ms.
[2024-05-20 23:16:06] [INFO ] Added : 9 causal constraints over 2 iterations in 1147 ms. Result :sat
Minimization took 5138 ms.
[2024-05-20 23:16:11] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:16:11] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:16:12] [INFO ] [Real]Absence check using state equation in 1221 ms returned sat
[2024-05-20 23:16:13] [INFO ] [Real]Added 6344 Read/Feed constraints in 997 ms returned sat
[2024-05-20 23:16:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:16:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 30 ms returned sat
[2024-05-20 23:16:14] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-20 23:16:15] [INFO ] [Nat]Absence check using state equation in 1215 ms returned sat
[2024-05-20 23:16:16] [INFO ] [Nat]Added 6344 Read/Feed constraints in 985 ms returned sat
[2024-05-20 23:16:16] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 331 ms.
[2024-05-20 23:16:18] [INFO ] Added : 13 causal constraints over 3 iterations in 1488 ms. Result :sat
Minimization took 5147 ms.
[2024-05-20 23:16:23] [INFO ] [Real]Absence check using 40 positive place invariants in 31 ms returned sat
[2024-05-20 23:16:23] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:16:24] [INFO ] [Real]Absence check using state equation in 1384 ms returned sat
[2024-05-20 23:16:25] [INFO ] [Real]Added 6344 Read/Feed constraints in 481 ms returned sat
[2024-05-20 23:16:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:16:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:16:25] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:16:27] [INFO ] [Nat]Absence check using state equation in 1426 ms returned sat
[2024-05-20 23:16:27] [INFO ] [Nat]Added 6344 Read/Feed constraints in 581 ms returned sat
[2024-05-20 23:16:28] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 327 ms.
[2024-05-20 23:16:29] [INFO ] Added : 7 causal constraints over 2 iterations in 1142 ms. Result :sat
Minimization took 5144 ms.
[2024-05-20 23:16:34] [INFO ] [Real]Absence check using 40 positive place invariants in 30 ms returned sat
[2024-05-20 23:16:34] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:16:35] [INFO ] [Real]Absence check using state equation in 1223 ms returned sat
[2024-05-20 23:16:36] [INFO ] [Real]Added 6344 Read/Feed constraints in 489 ms returned sat
[2024-05-20 23:16:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:16:36] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:16:36] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:16:37] [INFO ] [Nat]Absence check using state equation in 1238 ms returned sat
[2024-05-20 23:16:38] [INFO ] [Nat]Added 6344 Read/Feed constraints in 558 ms returned sat
[2024-05-20 23:16:38] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 307 ms.
[2024-05-20 23:16:39] [INFO ] Added : 9 causal constraints over 2 iterations in 1107 ms. Result :sat
Minimization took 5150 ms.
[2024-05-20 23:16:44] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:16:44] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:16:46] [INFO ] [Real]Absence check using state equation in 1214 ms returned sat
[2024-05-20 23:16:46] [INFO ] [Real]Added 6344 Read/Feed constraints in 474 ms returned sat
[2024-05-20 23:16:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:16:47] [INFO ] [Nat]Absence check using 40 positive place invariants in 32 ms returned sat
[2024-05-20 23:16:47] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:16:48] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2024-05-20 23:16:48] [INFO ] [Nat]Added 6344 Read/Feed constraints in 557 ms returned sat
[2024-05-20 23:16:49] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 313 ms.
[2024-05-20 23:16:50] [INFO ] Added : 9 causal constraints over 2 iterations in 1145 ms. Result :sat
Minimization took 5150 ms.
[2024-05-20 23:16:55] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:16:55] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:16:56] [INFO ] [Real]Absence check using state equation in 1254 ms returned sat
[2024-05-20 23:16:57] [INFO ] [Real]Added 6344 Read/Feed constraints in 469 ms returned sat
[2024-05-20 23:16:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:16:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:16:57] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:16:59] [INFO ] [Nat]Absence check using state equation in 1262 ms returned sat
[2024-05-20 23:16:59] [INFO ] [Nat]Added 6344 Read/Feed constraints in 577 ms returned sat
[2024-05-20 23:17:00] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 322 ms.
[2024-05-20 23:17:00] [INFO ] Added : 9 causal constraints over 2 iterations in 1135 ms. Result :sat
Minimization took 5152 ms.
[2024-05-20 23:17:06] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:17:06] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:17:07] [INFO ] [Real]Absence check using state equation in 1366 ms returned sat
[2024-05-20 23:17:08] [INFO ] [Real]Added 6344 Read/Feed constraints in 486 ms returned sat
[2024-05-20 23:17:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:17:08] [INFO ] [Nat]Absence check using 40 positive place invariants in 32 ms returned sat
[2024-05-20 23:17:08] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:17:09] [INFO ] [Nat]Absence check using state equation in 1364 ms returned sat
[2024-05-20 23:17:10] [INFO ] [Nat]Added 6344 Read/Feed constraints in 566 ms returned sat
[2024-05-20 23:17:10] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 317 ms.
[2024-05-20 23:17:11] [INFO ] Added : 10 causal constraints over 2 iterations in 1135 ms. Result :sat
Minimization took 5150 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
Support contains 15 out of 1923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Applied a total of 0 rules in 410 ms. Remains 1923 /1923 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 1923/1923 places, 6679/6679 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Applied a total of 0 rules in 188 ms. Remains 1923 /1923 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
[2024-05-20 23:17:17] [INFO ] Invariant cache hit.
[2024-05-20 23:17:19] [INFO ] Implicit Places using invariants in 1984 ms returned []
[2024-05-20 23:17:19] [INFO ] Invariant cache hit.
[2024-05-20 23:17:21] [INFO ] State equation strengthened by 6344 read => feed constraints.
[2024-05-20 23:17:51] [INFO ] Performed 756/1923 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:18:21] [INFO ] Performed 1700/1923 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:18:28] [INFO ] Implicit Places using invariants and state equation in 68473 ms returned []
Implicit Place search using SMT with State Equation took 70459 ms to find 0 implicit places.
[2024-05-20 23:18:28] [INFO ] Redundant transitions in 649 ms returned []
Running 6639 sub problems to find dead transitions.
[2024-05-20 23:18:28] [INFO ] Invariant cache hit.
[2024-05-20 23:18:28] [INFO ] State equation strengthened by 6344 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1922 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6639 unsolved
SMT process timed out in 37121ms, After SMT, problems are : Problem set: 0 solved, 6639 unsolved
Search for dead transitions found 0 dead transitions in 37207ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108558 ms. Remains : 1923/1923 places, 6679/6679 transitions.
[2024-05-20 23:19:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
RANDOM walk for 1000000 steps (5102 resets) in 11570 ms. (86 steps per ms)
BEST_FIRST walk for 15000015 steps (1512 resets) in 19374 ms. (774 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 14, 1, 1, 1, 1, 1] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
[2024-05-20 23:19:36] [INFO ] Invariant cache hit.
[2024-05-20 23:19:37] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:19:37] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:19:38] [INFO ] [Real]Absence check using state equation in 1316 ms returned sat
[2024-05-20 23:19:38] [INFO ] State equation strengthened by 6344 read => feed constraints.
[2024-05-20 23:19:39] [INFO ] [Real]Added 6344 Read/Feed constraints in 476 ms returned sat
[2024-05-20 23:19:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:19:39] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:19:39] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:19:40] [INFO ] [Nat]Absence check using state equation in 1231 ms returned sat
[2024-05-20 23:19:41] [INFO ] [Nat]Added 6344 Read/Feed constraints in 590 ms returned sat
[2024-05-20 23:19:41] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 319 ms.
[2024-05-20 23:19:42] [INFO ] Added : 9 causal constraints over 2 iterations in 1133 ms. Result :sat
Minimization took 5158 ms.
[2024-05-20 23:19:47] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:19:47] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:19:49] [INFO ] [Real]Absence check using state equation in 1229 ms returned sat
[2024-05-20 23:19:49] [INFO ] [Real]Added 6344 Read/Feed constraints in 484 ms returned sat
[2024-05-20 23:19:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:19:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:19:50] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:19:51] [INFO ] [Nat]Absence check using state equation in 1230 ms returned sat
[2024-05-20 23:19:51] [INFO ] [Nat]Added 6344 Read/Feed constraints in 656 ms returned sat
[2024-05-20 23:19:52] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 320 ms.
[2024-05-20 23:19:53] [INFO ] Added : 5 causal constraints over 1 iterations in 927 ms. Result :sat
Minimization took 5152 ms.
[2024-05-20 23:19:58] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:19:58] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:19:59] [INFO ] [Real]Absence check using state equation in 1237 ms returned sat
[2024-05-20 23:20:00] [INFO ] [Real]Added 6344 Read/Feed constraints in 496 ms returned sat
[2024-05-20 23:20:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:20:00] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:20:00] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:20:01] [INFO ] [Nat]Absence check using state equation in 1262 ms returned sat
[2024-05-20 23:20:02] [INFO ] [Nat]Added 6344 Read/Feed constraints in 585 ms returned sat
[2024-05-20 23:20:02] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 322 ms.
[2024-05-20 23:20:03] [INFO ] Added : 9 causal constraints over 2 iterations in 1180 ms. Result :sat
Minimization took 5146 ms.
[2024-05-20 23:20:09] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:20:09] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:20:10] [INFO ] [Real]Absence check using state equation in 1230 ms returned sat
[2024-05-20 23:20:11] [INFO ] [Real]Added 6344 Read/Feed constraints in 499 ms returned sat
[2024-05-20 23:20:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:20:11] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:20:11] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:20:12] [INFO ] [Nat]Absence check using state equation in 1244 ms returned sat
[2024-05-20 23:20:13] [INFO ] [Nat]Added 6344 Read/Feed constraints in 563 ms returned sat
[2024-05-20 23:20:13] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 326 ms.
[2024-05-20 23:20:14] [INFO ] Added : 7 causal constraints over 2 iterations in 1140 ms. Result :sat
Minimization took 5152 ms.
[2024-05-20 23:20:19] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:20:19] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:20:21] [INFO ] [Real]Absence check using state equation in 1239 ms returned sat
[2024-05-20 23:20:21] [INFO ] [Real]Added 6344 Read/Feed constraints in 481 ms returned sat
[2024-05-20 23:20:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:20:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 31 ms returned sat
[2024-05-20 23:20:22] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:20:23] [INFO ] [Nat]Absence check using state equation in 1256 ms returned sat
[2024-05-20 23:20:23] [INFO ] [Nat]Added 6344 Read/Feed constraints in 568 ms returned sat
[2024-05-20 23:20:24] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 324 ms.
[2024-05-20 23:20:25] [INFO ] Added : 9 causal constraints over 2 iterations in 1117 ms. Result :sat
Minimization took 5157 ms.
[2024-05-20 23:20:30] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:20:30] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:20:31] [INFO ] [Real]Absence check using state equation in 1255 ms returned sat
[2024-05-20 23:20:32] [INFO ] [Real]Added 6344 Read/Feed constraints in 496 ms returned sat
[2024-05-20 23:20:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:20:32] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:20:32] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:20:33] [INFO ] [Nat]Absence check using state equation in 1229 ms returned sat
[2024-05-20 23:20:34] [INFO ] [Nat]Added 6344 Read/Feed constraints in 630 ms returned sat
[2024-05-20 23:20:35] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 325 ms.
[2024-05-20 23:20:35] [INFO ] Added : 10 causal constraints over 2 iterations in 1135 ms. Result :sat
Minimization took 5144 ms.
[2024-05-20 23:20:41] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:20:41] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:20:42] [INFO ] [Real]Absence check using state equation in 1207 ms returned sat
[2024-05-20 23:20:43] [INFO ] [Real]Added 6344 Read/Feed constraints in 450 ms returned sat
[2024-05-20 23:20:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:20:43] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:20:43] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:20:44] [INFO ] [Nat]Absence check using state equation in 1189 ms returned sat
[2024-05-20 23:20:45] [INFO ] [Nat]Added 6344 Read/Feed constraints in 558 ms returned sat
[2024-05-20 23:20:45] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 324 ms.
[2024-05-20 23:20:46] [INFO ] Added : 7 causal constraints over 2 iterations in 1137 ms. Result :sat
Minimization took 5164 ms.
[2024-05-20 23:20:51] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:20:51] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:20:53] [INFO ] [Real]Absence check using state equation in 1269 ms returned sat
[2024-05-20 23:20:53] [INFO ] [Real]Added 6344 Read/Feed constraints in 473 ms returned sat
[2024-05-20 23:20:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:20:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 30 ms returned sat
[2024-05-20 23:20:54] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:20:55] [INFO ] [Nat]Absence check using state equation in 1253 ms returned sat
[2024-05-20 23:20:55] [INFO ] [Nat]Added 6344 Read/Feed constraints in 623 ms returned sat
[2024-05-20 23:20:56] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 324 ms.
[2024-05-20 23:20:57] [INFO ] Added : 10 causal constraints over 2 iterations in 1254 ms. Result :sat
Minimization took 5158 ms.
[2024-05-20 23:21:02] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:21:02] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:21:03] [INFO ] [Real]Absence check using state equation in 1180 ms returned sat
[2024-05-20 23:21:04] [INFO ] [Real]Added 6344 Read/Feed constraints in 470 ms returned sat
[2024-05-20 23:21:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:21:04] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:21:04] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:21:05] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2024-05-20 23:21:06] [INFO ] [Nat]Added 6344 Read/Feed constraints in 564 ms returned sat
[2024-05-20 23:21:07] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 316 ms.
[2024-05-20 23:21:07] [INFO ] Added : 9 causal constraints over 2 iterations in 1120 ms. Result :sat
Minimization took 5145 ms.
[2024-05-20 23:21:13] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2024-05-20 23:21:13] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:21:14] [INFO ] [Real]Absence check using state equation in 1213 ms returned sat
[2024-05-20 23:21:15] [INFO ] [Real]Added 6344 Read/Feed constraints in 877 ms returned sat
[2024-05-20 23:21:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:21:15] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:21:15] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-20 23:21:16] [INFO ] [Nat]Absence check using state equation in 1214 ms returned sat
[2024-05-20 23:21:17] [INFO ] [Nat]Added 6344 Read/Feed constraints in 986 ms returned sat
[2024-05-20 23:21:18] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 314 ms.
[2024-05-20 23:21:19] [INFO ] Added : 15 causal constraints over 3 iterations in 1346 ms. Result :sat
Minimization took 5148 ms.
[2024-05-20 23:21:24] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:21:24] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:21:26] [INFO ] [Real]Absence check using state equation in 1368 ms returned sat
[2024-05-20 23:21:26] [INFO ] [Real]Added 6344 Read/Feed constraints in 481 ms returned sat
[2024-05-20 23:21:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:21:27] [INFO ] [Nat]Absence check using 40 positive place invariants in 30 ms returned sat
[2024-05-20 23:21:27] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:21:28] [INFO ] [Nat]Absence check using state equation in 1391 ms returned sat
[2024-05-20 23:21:29] [INFO ] [Nat]Added 6344 Read/Feed constraints in 564 ms returned sat
[2024-05-20 23:21:29] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 316 ms.
[2024-05-20 23:21:30] [INFO ] Added : 7 causal constraints over 2 iterations in 1106 ms. Result :sat
Minimization took 5151 ms.
[2024-05-20 23:21:35] [INFO ] [Real]Absence check using 40 positive place invariants in 25 ms returned sat
[2024-05-20 23:21:35] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:21:36] [INFO ] [Real]Absence check using state equation in 1151 ms returned sat
[2024-05-20 23:21:37] [INFO ] [Real]Added 6344 Read/Feed constraints in 484 ms returned sat
[2024-05-20 23:21:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:21:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:21:37] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:21:38] [INFO ] [Nat]Absence check using state equation in 1216 ms returned sat
[2024-05-20 23:21:39] [INFO ] [Nat]Added 6344 Read/Feed constraints in 539 ms returned sat
[2024-05-20 23:21:39] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 319 ms.
[2024-05-20 23:21:40] [INFO ] Added : 9 causal constraints over 2 iterations in 1108 ms. Result :sat
Minimization took 5147 ms.
[2024-05-20 23:21:46] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:21:46] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:21:47] [INFO ] [Real]Absence check using state equation in 1220 ms returned sat
[2024-05-20 23:21:47] [INFO ] [Real]Added 6344 Read/Feed constraints in 466 ms returned sat
[2024-05-20 23:21:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:21:48] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:21:48] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-20 23:21:49] [INFO ] [Nat]Absence check using state equation in 1221 ms returned sat
[2024-05-20 23:21:50] [INFO ] [Nat]Added 6344 Read/Feed constraints in 543 ms returned sat
[2024-05-20 23:21:50] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 321 ms.
[2024-05-20 23:21:51] [INFO ] Added : 9 causal constraints over 2 iterations in 1143 ms. Result :sat
Minimization took 5156 ms.
[2024-05-20 23:21:56] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:21:56] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:21:57] [INFO ] [Real]Absence check using state equation in 1252 ms returned sat
[2024-05-20 23:21:58] [INFO ] [Real]Added 6344 Read/Feed constraints in 468 ms returned sat
[2024-05-20 23:21:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:21:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:21:58] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:22:00] [INFO ] [Nat]Absence check using state equation in 1252 ms returned sat
[2024-05-20 23:22:00] [INFO ] [Nat]Added 6344 Read/Feed constraints in 561 ms returned sat
[2024-05-20 23:22:01] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 316 ms.
[2024-05-20 23:22:01] [INFO ] Added : 9 causal constraints over 2 iterations in 1127 ms. Result :sat
Minimization took 5138 ms.
[2024-05-20 23:22:07] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:22:07] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:22:08] [INFO ] [Real]Absence check using state equation in 1318 ms returned sat
[2024-05-20 23:22:09] [INFO ] [Real]Added 6344 Read/Feed constraints in 477 ms returned sat
[2024-05-20 23:22:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:22:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:22:09] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:22:10] [INFO ] [Nat]Absence check using state equation in 1328 ms returned sat
[2024-05-20 23:22:11] [INFO ] [Nat]Added 6344 Read/Feed constraints in 571 ms returned sat
[2024-05-20 23:22:11] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 320 ms.
[2024-05-20 23:22:12] [INFO ] Added : 10 causal constraints over 2 iterations in 1120 ms. Result :sat
Minimization took 5148 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 14, 1, 1, 1, 1, 1] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 14, 1, 1, 1, 1, 1] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
Support contains 15 out of 1923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Applied a total of 0 rules in 171 ms. Remains 1923 /1923 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 1923/1923 places, 6679/6679 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Applied a total of 0 rules in 158 ms. Remains 1923 /1923 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
[2024-05-20 23:22:18] [INFO ] Invariant cache hit.
[2024-05-20 23:22:20] [INFO ] Implicit Places using invariants in 1907 ms returned []
[2024-05-20 23:22:20] [INFO ] Invariant cache hit.
[2024-05-20 23:22:21] [INFO ] State equation strengthened by 6344 read => feed constraints.
[2024-05-20 23:22:52] [INFO ] Performed 783/1923 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:23:22] [INFO ] Performed 1769/1923 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:23:26] [INFO ] Implicit Places using invariants and state equation in 66311 ms returned []
Implicit Place search using SMT with State Equation took 68220 ms to find 0 implicit places.
[2024-05-20 23:23:27] [INFO ] Redundant transitions in 577 ms returned []
Running 6639 sub problems to find dead transitions.
[2024-05-20 23:23:27] [INFO ] Invariant cache hit.
[2024-05-20 23:23:27] [INFO ] State equation strengthened by 6344 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1922 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6639 unsolved
SMT process timed out in 36355ms, After SMT, problems are : Problem set: 0 solved, 6639 unsolved
Search for dead transitions found 0 dead transitions in 36411ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105386 ms. Remains : 1923/1923 places, 6679/6679 transitions.
[2024-05-20 23:24:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 14, 1, 1, 1, 1, 1] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
RANDOM walk for 1000000 steps (5096 resets) in 11316 ms. (88 steps per ms)
BEST_FIRST walk for 15000013 steps (1514 resets) in 19040 ms. (787 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 14, 1, 1, 1, 1, 1] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
[2024-05-20 23:24:33] [INFO ] Invariant cache hit.
[2024-05-20 23:24:34] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2024-05-20 23:24:34] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:24:35] [INFO ] [Real]Absence check using state equation in 1212 ms returned sat
[2024-05-20 23:24:35] [INFO ] State equation strengthened by 6344 read => feed constraints.
[2024-05-20 23:24:35] [INFO ] [Real]Added 6344 Read/Feed constraints in 461 ms returned sat
[2024-05-20 23:24:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:24:36] [INFO ] [Nat]Absence check using 40 positive place invariants in 30 ms returned sat
[2024-05-20 23:24:36] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-20 23:24:37] [INFO ] [Nat]Absence check using state equation in 1287 ms returned sat
[2024-05-20 23:24:38] [INFO ] [Nat]Added 6344 Read/Feed constraints in 578 ms returned sat
[2024-05-20 23:24:38] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 306 ms.
[2024-05-20 23:24:39] [INFO ] Added : 9 causal constraints over 2 iterations in 1103 ms. Result :sat
Minimization took 5151 ms.
[2024-05-20 23:24:44] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:24:44] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:24:45] [INFO ] [Real]Absence check using state equation in 1199 ms returned sat
[2024-05-20 23:24:46] [INFO ] [Real]Added 6344 Read/Feed constraints in 478 ms returned sat
[2024-05-20 23:24:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:24:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:24:46] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:24:48] [INFO ] [Nat]Absence check using state equation in 1212 ms returned sat
[2024-05-20 23:24:48] [INFO ] [Nat]Added 6344 Read/Feed constraints in 652 ms returned sat
[2024-05-20 23:24:49] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 315 ms.
[2024-05-20 23:24:49] [INFO ] Added : 5 causal constraints over 1 iterations in 897 ms. Result :sat
Minimization took 5148 ms.
[2024-05-20 23:24:55] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:24:55] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:24:56] [INFO ] [Real]Absence check using state equation in 1228 ms returned sat
[2024-05-20 23:24:57] [INFO ] [Real]Added 6344 Read/Feed constraints in 483 ms returned sat
[2024-05-20 23:24:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:24:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:24:57] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-20 23:24:58] [INFO ] [Nat]Absence check using state equation in 1235 ms returned sat
[2024-05-20 23:24:59] [INFO ] [Nat]Added 6344 Read/Feed constraints in 584 ms returned sat
[2024-05-20 23:24:59] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 313 ms.
[2024-05-20 23:25:00] [INFO ] Added : 9 causal constraints over 2 iterations in 1158 ms. Result :sat
Minimization took 5145 ms.
[2024-05-20 23:25:05] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:25:05] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:25:07] [INFO ] [Real]Absence check using state equation in 1231 ms returned sat
[2024-05-20 23:25:07] [INFO ] [Real]Added 6344 Read/Feed constraints in 497 ms returned sat
[2024-05-20 23:25:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:25:08] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:25:08] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:25:09] [INFO ] [Nat]Absence check using state equation in 1232 ms returned sat
[2024-05-20 23:25:09] [INFO ] [Nat]Added 6344 Read/Feed constraints in 565 ms returned sat
[2024-05-20 23:25:10] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 322 ms.
[2024-05-20 23:25:11] [INFO ] Added : 7 causal constraints over 2 iterations in 1140 ms. Result :sat
Minimization took 5146 ms.
[2024-05-20 23:25:16] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:25:16] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:25:17] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2024-05-20 23:25:18] [INFO ] [Real]Added 6344 Read/Feed constraints in 493 ms returned sat
[2024-05-20 23:25:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:25:18] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:25:18] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-20 23:25:19] [INFO ] [Nat]Absence check using state equation in 1231 ms returned sat
[2024-05-20 23:25:20] [INFO ] [Nat]Added 6344 Read/Feed constraints in 560 ms returned sat
[2024-05-20 23:25:20] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 323 ms.
[2024-05-20 23:25:21] [INFO ] Added : 9 causal constraints over 2 iterations in 1126 ms. Result :sat
Minimization took 5151 ms.
[2024-05-20 23:25:27] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:25:27] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:25:28] [INFO ] [Real]Absence check using state equation in 1256 ms returned sat
[2024-05-20 23:25:29] [INFO ] [Real]Added 6344 Read/Feed constraints in 494 ms returned sat
[2024-05-20 23:25:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:25:29] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:25:29] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:25:30] [INFO ] [Nat]Absence check using state equation in 1294 ms returned sat
[2024-05-20 23:25:31] [INFO ] [Nat]Added 6344 Read/Feed constraints in 617 ms returned sat
[2024-05-20 23:25:31] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 314 ms.
[2024-05-20 23:25:32] [INFO ] Added : 10 causal constraints over 2 iterations in 1146 ms. Result :sat
Minimization took 5158 ms.
[2024-05-20 23:25:37] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:25:37] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:25:39] [INFO ] [Real]Absence check using state equation in 1236 ms returned sat
[2024-05-20 23:25:39] [INFO ] [Real]Added 6344 Read/Feed constraints in 456 ms returned sat
[2024-05-20 23:25:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:25:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:25:40] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:25:41] [INFO ] [Nat]Absence check using state equation in 1259 ms returned sat
[2024-05-20 23:25:41] [INFO ] [Nat]Added 6344 Read/Feed constraints in 568 ms returned sat
[2024-05-20 23:25:42] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 326 ms.
[2024-05-20 23:25:43] [INFO ] Added : 7 causal constraints over 2 iterations in 1151 ms. Result :sat
Minimization took 5149 ms.
[2024-05-20 23:25:48] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2024-05-20 23:25:48] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:25:49] [INFO ] [Real]Absence check using state equation in 1263 ms returned sat
[2024-05-20 23:25:50] [INFO ] [Real]Added 6344 Read/Feed constraints in 471 ms returned sat
[2024-05-20 23:25:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:25:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:25:50] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:25:52] [INFO ] [Nat]Absence check using state equation in 1263 ms returned sat
[2024-05-20 23:25:52] [INFO ] [Nat]Added 6344 Read/Feed constraints in 626 ms returned sat
[2024-05-20 23:25:53] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 323 ms.
[2024-05-20 23:25:54] [INFO ] Added : 10 causal constraints over 2 iterations in 1245 ms. Result :sat
Minimization took 5166 ms.
[2024-05-20 23:25:59] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:25:59] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-20 23:26:00] [INFO ] [Real]Absence check using state equation in 1249 ms returned sat
[2024-05-20 23:26:01] [INFO ] [Real]Added 6344 Read/Feed constraints in 494 ms returned sat
[2024-05-20 23:26:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:26:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:26:01] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:26:02] [INFO ] [Nat]Absence check using state equation in 1260 ms returned sat
[2024-05-20 23:26:03] [INFO ] [Nat]Added 6344 Read/Feed constraints in 588 ms returned sat
[2024-05-20 23:26:04] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 327 ms.
[2024-05-20 23:26:04] [INFO ] Added : 9 causal constraints over 2 iterations in 1148 ms. Result :sat
Minimization took 5146 ms.
[2024-05-20 23:26:10] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:26:10] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:26:11] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2024-05-20 23:26:12] [INFO ] [Real]Added 6344 Read/Feed constraints in 893 ms returned sat
[2024-05-20 23:26:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:26:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:26:12] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 23:26:14] [INFO ] [Nat]Absence check using state equation in 1279 ms returned sat
[2024-05-20 23:26:15] [INFO ] [Nat]Added 6344 Read/Feed constraints in 1027 ms returned sat
[2024-05-20 23:26:15] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 314 ms.
[2024-05-20 23:26:16] [INFO ] Added : 15 causal constraints over 3 iterations in 1509 ms. Result :sat
Minimization took 5151 ms.
[2024-05-20 23:26:22] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2024-05-20 23:26:22] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:26:23] [INFO ] [Real]Absence check using state equation in 1436 ms returned sat
[2024-05-20 23:26:24] [INFO ] [Real]Added 6344 Read/Feed constraints in 482 ms returned sat
[2024-05-20 23:26:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:26:24] [INFO ] [Nat]Absence check using 40 positive place invariants in 50 ms returned sat
[2024-05-20 23:26:24] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:26:26] [INFO ] [Nat]Absence check using state equation in 1412 ms returned sat
[2024-05-20 23:26:26] [INFO ] [Nat]Added 6344 Read/Feed constraints in 567 ms returned sat
[2024-05-20 23:26:27] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 323 ms.
[2024-05-20 23:26:27] [INFO ] Added : 7 causal constraints over 2 iterations in 1130 ms. Result :sat
Minimization took 5143 ms.
[2024-05-20 23:26:33] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:26:33] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 23:26:34] [INFO ] [Real]Absence check using state equation in 1240 ms returned sat
[2024-05-20 23:26:35] [INFO ] [Real]Added 6344 Read/Feed constraints in 484 ms returned sat
[2024-05-20 23:26:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:26:35] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:26:35] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:26:36] [INFO ] [Nat]Absence check using state equation in 1254 ms returned sat
[2024-05-20 23:26:37] [INFO ] [Nat]Added 6344 Read/Feed constraints in 546 ms returned sat
[2024-05-20 23:26:37] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 314 ms.
[2024-05-20 23:26:38] [INFO ] Added : 9 causal constraints over 2 iterations in 1097 ms. Result :sat
Minimization took 5149 ms.
[2024-05-20 23:26:43] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:26:43] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-20 23:26:45] [INFO ] [Real]Absence check using state equation in 1215 ms returned sat
[2024-05-20 23:26:45] [INFO ] [Real]Added 6344 Read/Feed constraints in 470 ms returned sat
[2024-05-20 23:26:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:26:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:26:46] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:26:47] [INFO ] [Nat]Absence check using state equation in 1185 ms returned sat
[2024-05-20 23:26:47] [INFO ] [Nat]Added 6344 Read/Feed constraints in 539 ms returned sat
[2024-05-20 23:26:48] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 315 ms.
[2024-05-20 23:26:49] [INFO ] Added : 9 causal constraints over 2 iterations in 1133 ms. Result :sat
Minimization took 5138 ms.
[2024-05-20 23:26:54] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:26:54] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:26:55] [INFO ] [Real]Absence check using state equation in 1226 ms returned sat
[2024-05-20 23:26:56] [INFO ] [Real]Added 6344 Read/Feed constraints in 474 ms returned sat
[2024-05-20 23:26:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:26:56] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:26:56] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:26:57] [INFO ] [Nat]Absence check using state equation in 1213 ms returned sat
[2024-05-20 23:26:58] [INFO ] [Nat]Added 6344 Read/Feed constraints in 568 ms returned sat
[2024-05-20 23:26:58] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 316 ms.
[2024-05-20 23:26:59] [INFO ] Added : 9 causal constraints over 2 iterations in 1140 ms. Result :sat
Minimization took 5137 ms.
[2024-05-20 23:27:04] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:27:04] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:27:06] [INFO ] [Real]Absence check using state equation in 1342 ms returned sat
[2024-05-20 23:27:06] [INFO ] [Real]Added 6344 Read/Feed constraints in 481 ms returned sat
[2024-05-20 23:27:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:27:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:27:07] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:27:08] [INFO ] [Nat]Absence check using state equation in 1338 ms returned sat
[2024-05-20 23:27:09] [INFO ] [Nat]Added 6344 Read/Feed constraints in 566 ms returned sat
[2024-05-20 23:27:09] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 315 ms.
[2024-05-20 23:27:10] [INFO ] Added : 10 causal constraints over 2 iterations in 1136 ms. Result :sat
Minimization took 5149 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 14, 1, 1, 1, 1, 1] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 14, 1, 1, 1, 1, 1] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
Support contains 15 out of 1923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Applied a total of 0 rules in 159 ms. Remains 1923 /1923 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 1923/1923 places, 6679/6679 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Applied a total of 0 rules in 163 ms. Remains 1923 /1923 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
[2024-05-20 23:27:15] [INFO ] Invariant cache hit.
[2024-05-20 23:27:17] [INFO ] Implicit Places using invariants in 1926 ms returned []
[2024-05-20 23:27:17] [INFO ] Invariant cache hit.
[2024-05-20 23:27:19] [INFO ] State equation strengthened by 6344 read => feed constraints.
[2024-05-20 23:27:49] [INFO ] Performed 779/1923 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:28:19] [INFO ] Performed 1719/1923 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:28:25] [INFO ] Implicit Places using invariants and state equation in 67784 ms returned []
Implicit Place search using SMT with State Equation took 69712 ms to find 0 implicit places.
[2024-05-20 23:28:26] [INFO ] Redundant transitions in 528 ms returned []
Running 6639 sub problems to find dead transitions.
[2024-05-20 23:28:26] [INFO ] Invariant cache hit.
[2024-05-20 23:28:26] [INFO ] State equation strengthened by 6344 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 1.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 1.0)
(s631 1.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 1.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 1.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 1.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 1.0)
(s904 1.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 1.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 1.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 1.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 1.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 1.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 1.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 1.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 1.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)timeout

(s1657 0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1922 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6639 unsolved
SMT process timed out in 36566ms, After SMT, problems are : Problem set: 0 solved, 6639 unsolved
Search for dead transitions found 0 dead transitions in 36620ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107048 ms. Remains : 1923/1923 places, 6679/6679 transitions.
RANDOM walk for 40000 steps (203 resets) in 2284 ms. (17 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
[2024-05-20 23:29:03] [INFO ] Flatten gal took : 603 ms
[2024-05-20 23:29:04] [INFO ] Flatten gal took : 310 ms
[2024-05-20 23:29:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6412401826196659683.gal : 110 ms
[2024-05-20 23:29:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6409310984343006145.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6412401826196659683.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6409310984343006145.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6409310984343006145.prop.
Interrupted probabilistic random walk after 94431 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 30
Probabilistic random walk after 94431 steps, saw 27637 distinct states, run finished after 3008 ms. (steps per millisecond=31 ) properties seen :0
[2024-05-20 23:29:06] [INFO ] Invariant cache hit.
[2024-05-20 23:29:06] [INFO ] State equation strengthened by 6344 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1826/1841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-20 23:29:07] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 6 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
Problem MAX13 is UNSAT
Problem MAX14 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1841 variables, 1/2 constraints. Problems are: Problem set: 15 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1841 variables, 0/2 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 78/1919 variables, 39/41 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1919 variables, 0/41 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/1921 variables, 2/43 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1921 variables, 0/43 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 6679/8600 variables, 1921/1964 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8600 variables, 6344/8308 constraints. Problems are: Problem set: 15 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8600/8602 variables, and 8308 constraints, problems are : Problem set: 15 solved, 15 unsolved in 5035 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1921/1923 constraints, ReadFeed: 6344/6344 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 15 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1826/1841 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1841 variables, 1/2 constraints. Problems are: Problem set: 15 solved, 15 unsolved
[2024-05-20 23:29:12] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1841 variables, 1/3 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/3 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 78/1919 variables, 39/42 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1919 variables, 0/42 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/1921 variables, 2/44 constraints. Problems are: Problem set: 15 solved, 15 unsolved
[2024-05-20 23:29:15] [INFO ] Deduced a trap composed of 46 places in 1386 ms of which 16 ms to minimize.
[2024-05-20 23:29:16] [INFO ] Deduced a trap composed of 44 places in 1274 ms of which 11 ms to minimize.
[2024-05-20 23:29:17] [INFO ] Deduced a trap composed of 55 places in 1238 ms of which 10 ms to minimize.
SMT process timed out in 11265ms, After SMT, problems are : Problem set: 15 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Applied a total of 0 rules in 155 ms. Remains 1923 /1923 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 1923/1923 places, 6679/6679 transitions.
RANDOM walk for 40000 steps (201 resets) in 933 ms. (42 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 109952 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 15
Probabilistic random walk after 109952 steps, saw 29499 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-20 23:29:21] [INFO ] Invariant cache hit.
[2024-05-20 23:29:21] [INFO ] State equation strengthened by 6344 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1826/1841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1841 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 78/1919 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1919 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/1921 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1921 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 6679/8600 variables, 1921/1963 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8600 variables, 6344/8307 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 4
SDD size :1 after 1696
At refinement iteration 9 (INCLUDED_ONLY) 0/8600 variables, 0/8307 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 8
SDD size :1696 after 1820
SDD proceeding with computation,30 properties remain. new max is 16
SDD size :1820 after 1970
At refinement iteration 10 (OVERLAPS) 2/8602 variables, 2/8309 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 32
SDD size :1970 after 2028
SDD proceeding with computation,30 properties remain. new max is 64
SDD size :2028 after 2620
At refinement iteration 11 (INCLUDED_ONLY) 0/8602 variables, 0/8309 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 128
SDD size :2620 after 3045
SDD proceeding with computation,30 properties remain. new max is 256
SDD size :3045 after 3260
SDD proceeding with computation,30 properties remain. new max is 512
SDD size :3260 after 3287
SDD proceeding with computation,30 properties remain. new max is 1024
SDD size :3287 after 3379
SDD proceeding with computation,30 properties remain. new max is 2048
SDD size :3379 after 3570
At refinement iteration 12 (OVERLAPS) 0/8602 variables, 0/8309 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8602/8602 variables, and 8309 constraints, problems are : Problem set: 0 solved, 15 unsolved in 20378 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1923/1923 constraints, ReadFeed: 6344/6344 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1826/1841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-20 23:29:42] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:29:42] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
SDD proceeding with computation,30 properties remain. new max is 4096
SDD size :3570 after 3880
At refinement iteration 2 (INCLUDED_ONLY) 0/1841 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1841 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 78/1919 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1919 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/1921 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-20 23:29:45] [INFO ] Deduced a trap composed of 47 places in 1411 ms of which 12 ms to minimize.
[2024-05-20 23:29:46] [INFO ] Deduced a trap composed of 52 places in 1377 ms of which 11 ms to minimize.
[2024-05-20 23:29:48] [INFO ] Deduced a trap composed of 47 places in 1350 ms of which 12 ms to minimize.
[2024-05-20 23:29:49] [INFO ] Deduced a trap composed of 98 places in 1376 ms of which 11 ms to minimize.
[2024-05-20 23:29:51] [INFO ] Deduced a trap composed of 85 places in 1398 ms of which 11 ms to minimize.
SDD proceeding with computation,30 properties remain. new max is 8192
SDD size :3880 after 4393
[2024-05-20 23:29:52] [INFO ] Deduced a trap composed of 55 places in 1282 ms of which 10 ms to minimize.
[2024-05-20 23:29:53] [INFO ] Deduced a trap composed of 54 places in 1280 ms of which 11 ms to minimize.
Detected timeout of ITS tools.
[2024-05-20 23:29:54] [INFO ] Flatten gal took : 128 ms
[2024-05-20 23:29:54] [INFO ] Applying decomposition
[2024-05-20 23:29:54] [INFO ] Flatten gal took : 132 ms
[2024-05-20 23:29:54] [INFO ] Deduced a trap composed of 54 places in 1206 ms of which 10 ms to minimize.
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/graph17342886885562333497.txt' '-o' '/tmp/graph17342886885562333497.bin' '-w' '/tmp/graph17342886885562333497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17342886885562333497.bin' '-l' '-1' '-v' '-w' '/tmp/graph17342886885562333497.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:29:55] [INFO ] Decomposing Gal with order
[2024-05-20 23:29:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:29:56] [INFO ] Removed a total of 5087 redundant transitions.
[2024-05-20 23:29:56] [INFO ] Deduced a trap composed of 54 places in 1247 ms of which 11 ms to minimize.
[2024-05-20 23:29:56] [INFO ] Flatten gal took : 926 ms
[2024-05-20 23:29:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 5777 labels/synchronizations in 383 ms.
[2024-05-20 23:29:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4556373290910285624.gal : 71 ms
[2024-05-20 23:29:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8301611557434199709.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4556373290910285624.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8301611557434199709.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2024-05-20 23:29:57] [INFO ] Deduced a trap composed of 52 places in 1188 ms of which 11 ms to minimize.
Loading property file /tmp/ReachabilityCardinality8301611557434199709.prop.
[2024-05-20 23:29:58] [INFO ] Deduced a trap composed of 55 places in 1306 ms of which 10 ms to minimize.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :24 after 24
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :24 after 24
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :24 after 24
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :24 after 24
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :24 after 24
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :24 after 24
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :24 after 32
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :32 after 450
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :450 after 935
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :935 after 9084
[2024-05-20 23:30:00] [INFO ] Deduced a trap composed of 52 places in 1314 ms of which 11 ms to minimize.
[2024-05-20 23:30:01] [INFO ] Deduced a trap composed of 52 places in 1301 ms of which 11 ms to minimize.
[2024-05-20 23:30:02] [INFO ] Deduced a trap composed of 52 places in 1292 ms of which 11 ms to minimize.
[2024-05-20 23:30:04] [INFO ] Deduced a trap composed of 54 places in 1297 ms of which 11 ms to minimize.
[2024-05-20 23:30:05] [INFO ] Deduced a trap composed of 53 places in 1303 ms of which 10 ms to minimize.
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :9084 after 97852
[2024-05-20 23:30:06] [INFO ] Deduced a trap composed of 51 places in 1303 ms of which 10 ms to minimize.
[2024-05-20 23:30:08] [INFO ] Deduced a trap composed of 51 places in 1326 ms of which 11 ms to minimize.
[2024-05-20 23:30:09] [INFO ] Deduced a trap composed of 51 places in 1326 ms of which 11 ms to minimize.
[2024-05-20 23:30:10] [INFO ] Deduced a trap composed of 53 places in 1316 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1921 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-20 23:30:12] [INFO ] Deduced a trap composed of 73 places in 1408 ms of which 11 ms to minimize.
[2024-05-20 23:30:13] [INFO ] Deduced a trap composed of 55 places in 1390 ms of which 10 ms to minimize.
[2024-05-20 23:30:15] [INFO ] Deduced a trap composed of 54 places in 1315 ms of which 10 ms to minimize.
[2024-05-20 23:30:16] [INFO ] Deduced a trap composed of 56 places in 1325 ms of which 24 ms to minimize.
[2024-05-20 23:30:17] [INFO ] Deduced a trap composed of 47 places in 1238 ms of which 10 ms to minimize.
[2024-05-20 23:30:19] [INFO ] Deduced a trap composed of 47 places in 1257 ms of which 10 ms to minimize.
[2024-05-20 23:30:20] [INFO ] Deduced a trap composed of 51 places in 1163 ms of which 17 ms to minimize.
[2024-05-20 23:30:21] [INFO ] Deduced a trap composed of 67 places in 1208 ms of which 10 ms to minimize.
[2024-05-20 23:30:22] [INFO ] Deduced a trap composed of 50 places in 1247 ms of which 10 ms to minimize.
[2024-05-20 23:30:23] [INFO ] Deduced a trap composed of 51 places in 1157 ms of which 9 ms to minimize.
[2024-05-20 23:30:25] [INFO ] Deduced a trap composed of 53 places in 1090 ms of which 9 ms to minimize.
[2024-05-20 23:30:26] [INFO ] Deduced a trap composed of 53 places in 1130 ms of which 9 ms to minimize.
[2024-05-20 23:30:27] [INFO ] Deduced a trap composed of 52 places in 1084 ms of which 8 ms to minimize.
SMT process timed out in 65711ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 1923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Applied a total of 0 rules in 176 ms. Remains 1923 /1923 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 1923/1923 places, 6679/6679 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Applied a total of 0 rules in 158 ms. Remains 1923 /1923 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
[2024-05-20 23:30:27] [INFO ] Invariant cache hit.
[2024-05-20 23:30:29] [INFO ] Implicit Places using invariants in 2093 ms returned []
[2024-05-20 23:30:29] [INFO ] Invariant cache hit.
[2024-05-20 23:30:31] [INFO ] State equation strengthened by 6344 read => feed constraints.
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :97852 after 608406
Detected timeout of ITS tools.
[2024-05-20 23:31:01] [INFO ] Performed 787/1923 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:31:31] [INFO ] Performed 1744/1923 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:31:36] [INFO ] Implicit Places using invariants and state equation in 66961 ms returned []
Implicit Place search using SMT with State Equation took 69054 ms to find 0 implicit places.
[2024-05-20 23:31:37] [INFO ] Redundant transitions in 530 ms returned []
Running 6639 sub problems to find dead transitions.
[2024-05-20 23:31:37] [INFO ] Invariant cache hit.
[2024-05-20 23:31:37] [INFO ] State equation strengthened by 6344 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1922 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6639 unsolved
SMT process timed out in 37018ms, After SMT, problems are : Problem set: 0 solved, 6639 unsolved
Search for dead transitions found 0 dead transitions in 37081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106863 ms. Remains : 1923/1923 places, 6679/6679 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 14, 1, 1, 1, 1, 1] Max Struct:[40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40]
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[40]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[40]
[2024-05-20 23:32:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[40]
RANDOM walk for 10000 steps (51 resets) in 108 ms. (91 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[40]
[2024-05-20 23:32:14] [INFO ] Invariant cache hit.
[2024-05-20 23:32:14] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:32:14] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:32:15] [INFO ] [Real]Absence check using state equation in 1218 ms returned sat
[2024-05-20 23:32:16] [INFO ] State equation strengthened by 6344 read => feed constraints.
[2024-05-20 23:32:16] [INFO ] [Real]Added 6344 Read/Feed constraints in 453 ms returned sat
[2024-05-20 23:32:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:32:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:32:16] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:32:18] [INFO ] [Nat]Absence check using state equation in 1224 ms returned sat
[2024-05-20 23:32:18] [INFO ] [Nat]Added 6344 Read/Feed constraints in 486 ms returned sat
[2024-05-20 23:32:19] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 321 ms.
[2024-05-20 23:32:19] [INFO ] Added : 0 causal constraints over 0 iterations in 705 ms. Result :sat
Minimization took 1295 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[40]
Support contains 1 out of 1923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1918 transition count 6674
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 1918 transition count 6673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 1917 transition count 6673
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 1917 transition count 6673
Applied a total of 19 rules in 581 ms. Remains 1917 /1923 variables (removed 6) and now considering 6673/6679 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 582 ms. Remains : 1917/1923 places, 6673/6679 transitions.
// Phase 1: matrix 6673 rows 1917 cols
[2024-05-20 23:32:21] [INFO ] Computed 42 invariants in 152 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[40]
RANDOM walk for 1000000 steps (5165 resets) in 11160 ms. (89 steps per ms)
BEST_FIRST walk for 1000001 steps (107 resets) in 1236 ms. (808 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-20 23:32:33] [INFO ] Invariant cache hit.
[2024-05-20 23:32:34] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:32:34] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:32:35] [INFO ] [Real]Absence check using state equation in 1160 ms returned sat
[2024-05-20 23:32:35] [INFO ] State equation strengthened by 6477 read => feed constraints.
[2024-05-20 23:32:35] [INFO ] [Real]Added 6477 Read/Feed constraints in 463 ms returned sat
[2024-05-20 23:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:32:36] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:32:36] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:32:37] [INFO ] [Nat]Absence check using state equation in 1177 ms returned sat
[2024-05-20 23:32:37] [INFO ] [Nat]Added 6477 Read/Feed constraints in 511 ms returned sat
[2024-05-20 23:32:38] [INFO ] Computed and/alt/rep : 4804/15469/4804 causal constraints (skipped 1829 transitions) in 319 ms.
[2024-05-20 23:32:39] [INFO ] Added : 7 causal constraints over 2 iterations in 1240 ms. Result :sat
Minimization took 5149 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 157 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 1917/1917 places, 6673/6673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 162 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
[2024-05-20 23:32:44] [INFO ] Invariant cache hit.
[2024-05-20 23:32:46] [INFO ] Implicit Places using invariants in 1966 ms returned []
[2024-05-20 23:32:46] [INFO ] Invariant cache hit.
[2024-05-20 23:32:48] [INFO ] State equation strengthened by 6477 read => feed constraints.
[2024-05-20 23:33:18] [INFO ] Performed 695/1917 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:33:48] [INFO ] Performed 1679/1917 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:33:55] [INFO ] Implicit Places using invariants and state equation in 68654 ms returned []
Implicit Place search using SMT with State Equation took 70622 ms to find 0 implicit places.
[2024-05-20 23:33:55] [INFO ] Redundant transitions in 499 ms returned []
Running 6633 sub problems to find dead transitions.
[2024-05-20 23:33:56] [INFO ] Invariant cache hit.
[2024-05-20 23:33:56] [INFO ] State equation strengthened by 6477 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1916 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6633 unsolved
SMT process timed out in 36957ms, After SMT, problems are : Problem set: 0 solved, 6633 unsolved
Search for dead transitions found 0 dead transitions in 37021ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108339 ms. Remains : 1917/1917 places, 6673/6673 transitions.
[2024-05-20 23:34:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[40]
RANDOM walk for 1000000 steps (5156 resets) in 10821 ms. (92 steps per ms)
BEST_FIRST walk for 1000001 steps (108 resets) in 1312 ms. (761 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-20 23:34:45] [INFO ] Invariant cache hit.
[2024-05-20 23:34:45] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2024-05-20 23:34:45] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:34:46] [INFO ] [Real]Absence check using state equation in 1191 ms returned sat
[2024-05-20 23:34:46] [INFO ] State equation strengthened by 6477 read => feed constraints.
[2024-05-20 23:34:47] [INFO ] [Real]Added 6477 Read/Feed constraints in 465 ms returned sat
[2024-05-20 23:34:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:34:47] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:34:47] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-20 23:34:48] [INFO ] [Nat]Absence check using state equation in 1164 ms returned sat
[2024-05-20 23:34:49] [INFO ] [Nat]Added 6477 Read/Feed constraints in 510 ms returned sat
[2024-05-20 23:34:49] [INFO ] Computed and/alt/rep : 4804/15469/4804 causal constraints (skipped 1829 transitions) in 322 ms.
[2024-05-20 23:34:50] [INFO ] Added : 7 causal constraints over 2 iterations in 1117 ms. Result :sat
Minimization took 5150 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 163 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 1917/1917 places, 6673/6673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 154 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
[2024-05-20 23:34:55] [INFO ] Invariant cache hit.
[2024-05-20 23:34:57] [INFO ] Implicit Places using invariants in 1968 ms returned []
[2024-05-20 23:34:57] [INFO ] Invariant cache hit.
[2024-05-20 23:34:59] [INFO ] State equation strengthened by 6477 read => feed constraints.
[2024-05-20 23:35:29] [INFO ] Performed 705/1917 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:35:59] [INFO ] Performed 1696/1917 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:36:06] [INFO ] Implicit Places using invariants and state equation in 68220 ms returned []
Implicit Place search using SMT with State Equation took 70189 ms to find 0 implicit places.
[2024-05-20 23:36:06] [INFO ] Redundant transitions in 513 ms returned []
Running 6633 sub problems to find dead transitions.
[2024-05-20 23:36:06] [INFO ] Invariant cache hit.
[2024-05-20 23:36:06] [INFO ] State equation strengthened by 6477 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 1.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 1.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 1.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 1.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 1.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1916 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6633 unsolved
SMT process timed out in 36744ms, After SMT, problems are : Problem set: 0 solved, 6633 unsolved
Search for dead transitions found 0 dead transitions in 36800ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107673 ms. Remains : 1917/1917 places, 6673/6673 transitions.
[2024-05-20 23:36:43] [INFO ] Flatten gal took : 137 ms
RANDOM walk for 40000 steps (204 resets) in 898 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
[2024-05-20 23:36:43] [INFO ] Flatten gal took : 230 ms
[2024-05-20 23:36:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16050992354677442188.gal : 26 ms
[2024-05-20 23:36:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12163560170665989716.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16050992354677442188.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12163560170665989716.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12163560170665989716.prop.
Interrupted probabilistic random walk after 116031 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 2
Probabilistic random walk after 116031 steps, saw 32970 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-20 23:36:46] [INFO ] Invariant cache hit.
[2024-05-20 23:36:46] [INFO ] State equation strengthened by 6477 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1834/1835 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:36:47] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-20 23:36:47] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:36:47] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-20 23:36:47] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:36:47] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-20 23:36:47] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:36:47] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-20 23:36:47] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:36:47] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:36:47] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:36:47] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 7 ms to minimize.
[2024-05-20 23:36:47] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-20 23:36:47] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:36:48] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-20 23:36:48] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-20 23:36:48] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:36:48] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-20 23:36:48] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-20 23:36:48] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-20 23:36:48] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 20/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1913 variables, 39/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1913 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1915 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 23:36:50] [INFO ] Deduced a trap composed of 46 places in 1580 ms of which 13 ms to minimize.
[2024-05-20 23:36:51] [INFO ] Deduced a trap composed of 47 places in 1581 ms of which 12 ms to minimize.
SMT process timed out in 5171ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 164 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 1917/1917 places, 6673/6673 transitions.
RANDOM walk for 40000 steps (203 resets) in 653 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 134095 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 1
Probabilistic random walk after 134095 steps, saw 35301 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-20 23:36:55] [INFO ] Invariant cache hit.
[2024-05-20 23:36:55] [INFO ] State equation strengthened by 6477 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1834/1835 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:36:55] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 0 ms to minimize.
[2024-05-20 23:36:55] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1913 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1913 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1915 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:36:57] [INFO ] Deduced a trap composed of 47 places in 1603 ms of which 12 ms to minimize.
[2024-05-20 23:36:59] [INFO ] Deduced a trap composed of 46 places in 1555 ms of which 12 ms to minimize.
[2024-05-20 23:36:59] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2024-05-20 23:36:59] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1915 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1915 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6673/8588 variables, 1915/1963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8588 variables, 6477/8440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8588 variables, 0/8440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/8590 variables, 2/8442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8590 variables, 0/8442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8590 variables, 0/8442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8590/8590 variables, and 8442 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6380 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1917/1917 constraints, ReadFeed: 6477/6477 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1834/1835 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:37:02] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-20 23:37:02] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-20 23:37:02] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-20 23:37:02] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:37:02] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-20 23:37:02] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:37:02] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:37:02] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:37:02] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-20 23:37:02] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:37:02] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:37:02] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:37:02] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:37:03] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:37:04] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-20 23:37:04] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:37:04] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-20 23:37:04] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-20 23:37:04] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:37:04] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:37:04] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:37:04] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:37:04] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:37:04] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1835 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1835 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1913 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1913 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1915 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1915 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:37:06] [INFO ] Deduced a trap composed of 45 places in 1543 ms of which 12 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1696
[2024-05-20 23:37:08] [INFO ] Deduced a trap composed of 83 places in 1626 ms of which 12 ms to minimize.
[2024-05-20 23:37:09] [INFO ] Deduced a trap composed of 50 places in 1584 ms of which 12 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1696 after 1820
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1820 after 2026
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2026 after 2364
[2024-05-20 23:37:11] [INFO ] Deduced a trap composed of 53 places in 1563 ms of which 12 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2364 after 2835
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2835 after 3198
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3198 after 3250
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3250 after 3280
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3280 after 3360
[2024-05-20 23:37:12] [INFO ] Deduced a trap composed of 53 places in 1603 ms of which 12 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3360 after 3565
[2024-05-20 23:37:14] [INFO ] Deduced a trap composed of 46 places in 1528 ms of which 11 ms to minimize.
[2024-05-20 23:37:16] [INFO ] Deduced a trap composed of 47 places in 1661 ms of which 13 ms to minimize.
[2024-05-20 23:37:17] [INFO ] Deduced a trap composed of 46 places in 1564 ms of which 11 ms to minimize.
[2024-05-20 23:37:19] [INFO ] Deduced a trap composed of 58 places in 1591 ms of which 12 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3565 after 3847
[2024-05-20 23:37:21] [INFO ] Deduced a trap composed of 55 places in 1543 ms of which 12 ms to minimize.
[2024-05-20 23:37:22] [INFO ] Deduced a trap composed of 53 places in 1553 ms of which 12 ms to minimize.
[2024-05-20 23:37:24] [INFO ] Deduced a trap composed of 57 places in 1522 ms of which 12 ms to minimize.
[2024-05-20 23:37:25] [INFO ] Deduced a trap composed of 46 places in 1526 ms of which 12 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3847 after 4345
[2024-05-20 23:37:27] [INFO ] Deduced a trap composed of 45 places in 1545 ms of which 11 ms to minimize.
[2024-05-20 23:37:28] [INFO ] Deduced a trap composed of 46 places in 1545 ms of which 12 ms to minimize.
[2024-05-20 23:37:30] [INFO ] Deduced a trap composed of 51 places in 1578 ms of which 11 ms to minimize.
[2024-05-20 23:37:32] [INFO ] Deduced a trap composed of 52 places in 1557 ms of which 12 ms to minimize.
[2024-05-20 23:37:33] [INFO ] Deduced a trap composed of 56 places in 1606 ms of which 12 ms to minimize.
Detected timeout of ITS tools.
[2024-05-20 23:37:34] [INFO ] Flatten gal took : 129 ms
[2024-05-20 23:37:34] [INFO ] Applying decomposition
[2024-05-20 23:37:34] [INFO ] Flatten gal took : 131 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/graph10063252500622763803.txt' '-o' '/tmp/graph10063252500622763803.bin' '-w' '/tmp/graph10063252500622763803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10063252500622763803.bin' '-l' '-1' '-v' '-w' '/tmp/graph10063252500622763803.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:37:34] [INFO ] Decomposing Gal with order
[2024-05-20 23:37:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:37:34] [INFO ] Removed a total of 4993 redundant transitions.
[2024-05-20 23:37:35] [INFO ] Flatten gal took : 358 ms
[2024-05-20 23:37:35] [INFO ] Deduced a trap composed of 48 places in 1414 ms of which 11 ms to minimize.
[2024-05-20 23:37:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 6162 labels/synchronizations in 257 ms.
[2024-05-20 23:37:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1125410267760044012.gal : 75 ms
[2024-05-20 23:37:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3962094692826440035.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1125410267760044012.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3962094692826440035.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3962094692826440035.prop.
[2024-05-20 23:37:36] [INFO ] Deduced a trap composed of 47 places in 1382 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1915 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 274
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :274 after 274
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :274 after 274
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :274 after 274
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :274 after 274
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :274 after 274
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :274 after 274
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :274 after 274
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :274 after 274
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :274 after 274
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :274 after 65626
[2024-05-20 23:37:38] [INFO ] Deduced a trap composed of 73 places in 1603 ms of which 12 ms to minimize.
[2024-05-20 23:37:39] [INFO ] Deduced a trap composed of 50 places in 1565 ms of which 11 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :65626 after 2.04797e+06
[2024-05-20 23:37:41] [INFO ] Deduced a trap composed of 60 places in 1572 ms of which 12 ms to minimize.
[2024-05-20 23:37:42] [INFO ] Deduced a trap composed of 59 places in 1494 ms of which 11 ms to minimize.
[2024-05-20 23:37:44] [INFO ] Deduced a trap composed of 55 places in 1568 ms of which 16 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.04797e+06 after 4.14381e+06
[2024-05-20 23:37:46] [INFO ] Deduced a trap composed of 49 places in 1555 ms of which 11 ms to minimize.
[2024-05-20 23:37:47] [INFO ] Deduced a trap composed of 59 places in 1576 ms of which 12 ms to minimize.
SMT process timed out in 52401ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 168 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 1917/1917 places, 6673/6673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 167 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
[2024-05-20 23:37:48] [INFO ] Invariant cache hit.
[2024-05-20 23:37:50] [INFO ] Implicit Places using invariants in 2031 ms returned []
[2024-05-20 23:37:50] [INFO ] Invariant cache hit.
[2024-05-20 23:37:51] [INFO ] State equation strengthened by 6477 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.14381e+06 after 6.44892e+07
[2024-05-20 23:38:22] [INFO ] Performed 619/1917 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :6.44892e+07 after 1.09612e+08
Detected timeout of ITS tools.
[2024-05-20 23:38:52] [INFO ] Performed 1500/1917 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:39:04] [INFO ] Implicit Places using invariants and state equation in 74457 ms returned []
Implicit Place search using SMT with State Equation took 76491 ms to find 0 implicit places.
[2024-05-20 23:39:05] [INFO ] Redundant transitions in 514 ms returned []
Running 6633 sub problems to find dead transitions.
[2024-05-20 23:39:05] [INFO ] Invariant cache hit.
[2024-05-20 23:39:05] [INFO ] State equation strengthened by 6477 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 1.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 1.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 1.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 1.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1916 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6633 unsolved
SMT process timed out in 36942ms, After SMT, problems are : Problem set: 0 solved, 6633 unsolved
Search for dead transitions found 0 dead transitions in 37001ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114218 ms. Remains : 1917/1917 places, 6673/6673 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[40]
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-00 in 447809 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[40]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[40]
// Phase 1: matrix 6679 rows 1923 cols
[2024-05-20 23:39:42] [INFO ] Computed 42 invariants in 174 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[40]
RANDOM walk for 10000 steps (50 resets) in 135 ms. (73 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-20 23:39:42] [INFO ] Invariant cache hit.
[2024-05-20 23:39:42] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2024-05-20 23:39:42] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-20 23:39:43] [INFO ] [Real]Absence check using state equation in 1234 ms returned sat
[2024-05-20 23:39:44] [INFO ] State equation strengthened by 6344 read => feed constraints.
[2024-05-20 23:39:44] [INFO ] [Real]Added 6344 Read/Feed constraints in 492 ms returned sat
[2024-05-20 23:39:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:39:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:39:44] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:39:46] [INFO ] [Nat]Absence check using state equation in 1241 ms returned sat
[2024-05-20 23:39:46] [INFO ] [Nat]Added 6344 Read/Feed constraints in 677 ms returned sat
[2024-05-20 23:39:47] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 350 ms.
[2024-05-20 23:39:47] [INFO ] Added : 5 causal constraints over 1 iterations in 946 ms. Result :sat
Minimization took 1293 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1918 transition count 6674
Partial Free-agglomeration rule applied 124 times.
Drop transitions (Partial Free agglomeration) removed 124 transitions
Iterating global reduction 0 with 124 rules applied. Total rules applied 134 place count 1918 transition count 6674
Applied a total of 134 rules in 433 ms. Remains 1918 /1923 variables (removed 5) and now considering 6674/6679 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 1918/1923 places, 6674/6679 transitions.
// Phase 1: matrix 6674 rows 1918 cols
[2024-05-20 23:39:49] [INFO ] Computed 42 invariants in 188 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[40]
RANDOM walk for 1000000 steps (5166 resets) in 10812 ms. (92 steps per ms)
BEST_FIRST walk for 1000001 steps (107 resets) in 1236 ms. (808 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-20 23:40:01] [INFO ] Invariant cache hit.
[2024-05-20 23:40:02] [INFO ] [Real]Absence check using 40 positive place invariants in 25 ms returned sat
[2024-05-20 23:40:02] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:40:03] [INFO ] [Real]Absence check using state equation in 1197 ms returned sat
[2024-05-20 23:40:03] [INFO ] State equation strengthened by 6478 read => feed constraints.
[2024-05-20 23:40:04] [INFO ] [Real]Added 6478 Read/Feed constraints in 458 ms returned sat
[2024-05-20 23:40:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:40:04] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:40:04] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:40:05] [INFO ] [Nat]Absence check using state equation in 1180 ms returned sat
[2024-05-20 23:40:07] [INFO ] [Nat]Added 6478 Read/Feed constraints in 1485 ms returned sat
[2024-05-20 23:40:07] [INFO ] Computed and/alt/rep : 4805/15471/4805 causal constraints (skipped 1829 transitions) in 321 ms.
[2024-05-20 23:40:08] [INFO ] Added : 13 causal constraints over 3 iterations in 1519 ms. Result :sat
Minimization took 5155 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1918 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 165 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 1918/1918 places, 6674/6674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 154 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
[2024-05-20 23:40:14] [INFO ] Invariant cache hit.
[2024-05-20 23:40:16] [INFO ] Implicit Places using invariants in 1989 ms returned []
[2024-05-20 23:40:16] [INFO ] Invariant cache hit.
[2024-05-20 23:40:17] [INFO ] State equation strengthened by 6478 read => feed constraints.
[2024-05-20 23:40:48] [INFO ] Performed 728/1918 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:41:18] [INFO ] Performed 1673/1918 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:41:26] [INFO ] Implicit Places using invariants and state equation in 70195 ms returned []
Implicit Place search using SMT with State Equation took 72186 ms to find 0 implicit places.
[2024-05-20 23:41:26] [INFO ] Redundant transitions in 501 ms returned []
Running 6634 sub problems to find dead transitions.
[2024-05-20 23:41:26] [INFO ] Invariant cache hit.
[2024-05-20 23:41:26] [INFO ] State equation strengthened by 6478 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1917 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6634 unsolved
SMT process timed out in 36690ms, After SMT, problems are : Problem set: 0 solved, 6634 unsolved
Search for dead transitions found 0 dead transitions in 36749ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109612 ms. Remains : 1918/1918 places, 6674/6674 transitions.
[2024-05-20 23:42:03] [INFO ] Flatten gal took : 128 ms
RANDOM walk for 40000 steps (203 resets) in 910 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
[2024-05-20 23:42:03] [INFO ] Flatten gal took : 143 ms
[2024-05-20 23:42:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11493100211753948809.gal : 25 ms
[2024-05-20 23:42:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9777182682581850801.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11493100211753948809.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9777182682581850801.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality9777182682581850801.prop.
Interrupted probabilistic random walk after 120506 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 120506 steps, saw 33566 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-20 23:42:06] [INFO ] Invariant cache hit.
[2024-05-20 23:42:07] [INFO ] State equation strengthened by 6478 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1835/1836 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:42:07] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-20 23:42:07] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:42:07] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:42:07] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:42:07] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:42:07] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:42:07] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:42:07] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:42:07] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:42:07] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:42:07] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:42:08] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:42:08] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:42:08] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:42:08] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:42:08] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:42:08] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:42:08] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:42:08] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:42:08] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1836 variables, 20/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1836 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1914 variables, 39/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1914 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1916 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 23:42:10] [INFO ] Deduced a trap composed of 45 places in 1496 ms of which 12 ms to minimize.
[2024-05-20 23:42:10] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-05-20 23:42:10] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2024-05-20 23:42:10] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-05-20 23:42:10] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-20 23:42:10] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-05-20 23:42:11] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2024-05-20 23:42:11] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1916 variables, 8/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1916 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8590/8592 variables, and 1986 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1916/1918 constraints, ReadFeed: 0/6478 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1835/1836 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1836 variables, 20/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 23:42:12] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-20 23:42:12] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:42:12] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-20 23:42:12] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:42:12] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:42:12] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:42:12] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:42:12] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-20 23:42:12] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:42:12] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:42:13] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:42:13] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:42:13] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-20 23:42:13] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-20 23:42:13] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-20 23:42:13] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-20 23:42:13] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-20 23:42:13] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:42:13] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1836 variables, 19/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1836 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 78/1914 variables, 39/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1914 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1916 variables, 2/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1916 variables, 8/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 23:42:15] [INFO ] Deduced a trap composed of 45 places in 1499 ms of which 11 ms to minimize.
[2024-05-20 23:42:16] [INFO ] Deduced a trap composed of 51 places in 1541 ms of which 12 ms to minimize.
[2024-05-20 23:42:18] [INFO ] Deduced a trap composed of 46 places in 1525 ms of which 12 ms to minimize.
SMT process timed out in 11455ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1918 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 158 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 1918/1918 places, 6674/6674 transitions.
RANDOM walk for 40000 steps (204 resets) in 623 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 133304 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 1
Probabilistic random walk after 133304 steps, saw 35204 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-20 23:42:21] [INFO ] Invariant cache hit.
[2024-05-20 23:42:21] [INFO ] State equation strengthened by 6478 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1835/1836 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:42:22] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1836 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1836 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1914 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1914 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1916 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:42:23] [INFO ] Deduced a trap composed of 47 places in 1545 ms of which 12 ms to minimize.
[2024-05-20 23:42:25] [INFO ] Deduced a trap composed of 62 places in 1412 ms of which 11 ms to minimize.
[2024-05-20 23:42:26] [INFO ] Deduced a trap composed of 59 places in 1402 ms of which 11 ms to minimize.
[2024-05-20 23:42:28] [INFO ] Deduced a trap composed of 54 places in 1346 ms of which 11 ms to minimize.
[2024-05-20 23:42:29] [INFO ] Deduced a trap composed of 52 places in 1373 ms of which 10 ms to minimize.
[2024-05-20 23:42:30] [INFO ] Deduced a trap composed of 47 places in 1329 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1696
[2024-05-20 23:42:32] [INFO ] Deduced a trap composed of 57 places in 1371 ms of which 10 ms to minimize.
[2024-05-20 23:42:33] [INFO ] Deduced a trap composed of 49 places in 1263 ms of which 10 ms to minimize.
[2024-05-20 23:42:34] [INFO ] Deduced a trap composed of 80 places in 1237 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1696 after 1820
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1820 after 2026
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2026 after 2364
[2024-05-20 23:42:36] [INFO ] Deduced a trap composed of 65 places in 1233 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2364 after 2835
[2024-05-20 23:42:37] [INFO ] Deduced a trap composed of 65 places in 1266 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2835 after 3198
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3198 after 3250
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3250 after 3280
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3280 after 3360
[2024-05-20 23:42:38] [INFO ] Deduced a trap composed of 48 places in 1256 ms of which 10 ms to minimize.
[2024-05-20 23:42:39] [INFO ] Deduced a trap composed of 50 places in 1237 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3360 after 3566
[2024-05-20 23:42:41] [INFO ] Deduced a trap composed of 47 places in 1149 ms of which 10 ms to minimize.
[2024-05-20 23:42:42] [INFO ] Deduced a trap composed of 50 places in 1132 ms of which 12 ms to minimize.
[2024-05-20 23:42:43] [INFO ] Deduced a trap composed of 47 places in 1128 ms of which 10 ms to minimize.
[2024-05-20 23:42:44] [INFO ] Deduced a trap composed of 58 places in 1145 ms of which 10 ms to minimize.
[2024-05-20 23:42:45] [INFO ] Deduced a trap composed of 46 places in 1135 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3566 after 3848
[2024-05-20 23:42:46] [INFO ] Deduced a trap composed of 76 places in 1074 ms of which 9 ms to minimize.
[2024-05-20 23:42:48] [INFO ] Deduced a trap composed of 48 places in 1055 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1916 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:42:49] [INFO ] Deduced a trap composed of 49 places in 994 ms of which 8 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 69 places in 1027 ms of which 8 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 61 places in 1024 ms of which 9 ms to minimize.
[2024-05-20 23:42:52] [INFO ] Deduced a trap composed of 66 places in 1010 ms of which 9 ms to minimize.
[2024-05-20 23:42:53] [INFO ] Deduced a trap composed of 65 places in 1012 ms of which 9 ms to minimize.
Detected timeout of ITS tools.
[2024-05-20 23:42:54] [INFO ] Flatten gal took : 127 ms
[2024-05-20 23:42:54] [INFO ] Applying decomposition
[2024-05-20 23:42:54] [INFO ] Flatten gal took : 131 ms
[2024-05-20 23:42:54] [INFO ] Deduced a trap composed of 81 places in 1047 ms of which 17 ms to minimize.
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/graph17777890327571630403.txt' '-o' '/tmp/graph17777890327571630403.bin' '-w' '/tmp/graph17777890327571630403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17777890327571630403.bin' '-l' '-1' '-v' '-w' '/tmp/graph17777890327571630403.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:42:54] [INFO ] Decomposing Gal with order
[2024-05-20 23:42:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:42:55] [INFO ] Removed a total of 4995 redundant transitions.
[2024-05-20 23:42:55] [INFO ] Flatten gal took : 398 ms
[2024-05-20 23:42:55] [INFO ] Deduced a trap composed of 53 places in 928 ms of which 8 ms to minimize.
[2024-05-20 23:42:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 6320 labels/synchronizations in 267 ms.
[2024-05-20 23:42:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12130813488153214317.gal : 52 ms
[2024-05-20 23:42:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11591524687161871832.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12130813488153214317.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11591524687161871832.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
[2024-05-20 23:42:56] [INFO ] Deduced a trap composed of 52 places in 960 ms of which 9 ms to minimize.
Loading property file /tmp/ReachabilityCardinality11591524687161871832.prop.
[2024-05-20 23:42:57] [INFO ] Deduced a trap composed of 78 places in 1051 ms of which 9 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 39
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :39 after 39
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :39 after 39
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :39 after 39
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :39 after 39
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :39 after 39
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :39 after 39
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :39 after 39
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :39 after 672
[2024-05-20 23:42:58] [INFO ] Deduced a trap composed of 58 places in 1049 ms of which 9 ms to minimize.
[2024-05-20 23:42:59] [INFO ] Deduced a trap composed of 48 places in 1018 ms of which 9 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :672 after 14606
[2024-05-20 23:43:00] [INFO ] Deduced a trap composed of 48 places in 1035 ms of which 9 ms to minimize.
[2024-05-20 23:43:01] [INFO ] Deduced a trap composed of 69 places in 986 ms of which 9 ms to minimize.
[2024-05-20 23:43:02] [INFO ] Deduced a trap composed of 61 places in 993 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1916 variables, 14/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1916 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6674/8590 variables, 1916/1993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8590 variables, 6478/8471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8590 variables, 0/8471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/8592 variables, 2/8473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8592 variables, 0/8473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/8592 variables, 0/8473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8592/8592 variables, and 8473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43773 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1918/1918 constraints, ReadFeed: 6478/6478 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1835/1836 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1836 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1836 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1914 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1914 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1916 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1916 variables, 34/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:43:07] [INFO ] Deduced a trap composed of 46 places in 1475 ms of which 11 ms to minimize.
[2024-05-20 23:43:08] [INFO ] Deduced a trap composed of 52 places in 1415 ms of which 11 ms to minimize.
[2024-05-20 23:43:10] [INFO ] Deduced a trap composed of 51 places in 1410 ms of which 11 ms to minimize.
[2024-05-20 23:43:11] [INFO ] Deduced a trap composed of 51 places in 1431 ms of which 11 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :14606 after 181574
[2024-05-20 23:43:13] [INFO ] Deduced a trap composed of 50 places in 1420 ms of which 10 ms to minimize.
[2024-05-20 23:43:14] [INFO ] Deduced a trap composed of 47 places in 1395 ms of which 11 ms to minimize.
[2024-05-20 23:43:16] [INFO ] Deduced a trap composed of 47 places in 1414 ms of which 12 ms to minimize.
[2024-05-20 23:43:17] [INFO ] Deduced a trap composed of 49 places in 1390 ms of which 11 ms to minimize.
[2024-05-20 23:43:19] [INFO ] Deduced a trap composed of 48 places in 1409 ms of which 11 ms to minimize.
[2024-05-20 23:43:20] [INFO ] Deduced a trap composed of 49 places in 1345 ms of which 11 ms to minimize.
[2024-05-20 23:43:21] [INFO ] Deduced a trap composed of 48 places in 1372 ms of which 11 ms to minimize.
[2024-05-20 23:43:23] [INFO ] Deduced a trap composed of 46 places in 1339 ms of which 12 ms to minimize.
[2024-05-20 23:43:24] [INFO ] Deduced a trap composed of 51 places in 1306 ms of which 11 ms to minimize.
[2024-05-20 23:43:25] [INFO ] Deduced a trap composed of 46 places in 1236 ms of which 11 ms to minimize.
[2024-05-20 23:43:27] [INFO ] Deduced a trap composed of 74 places in 1213 ms of which 10 ms to minimize.
[2024-05-20 23:43:28] [INFO ] Deduced a trap composed of 53 places in 1197 ms of which 9 ms to minimize.
[2024-05-20 23:43:29] [INFO ] Deduced a trap composed of 50 places in 1189 ms of which 9 ms to minimize.
[2024-05-20 23:43:30] [INFO ] Deduced a trap composed of 62 places in 1160 ms of which 10 ms to minimize.
[2024-05-20 23:43:31] [INFO ] Deduced a trap composed of 53 places in 1152 ms of which 10 ms to minimize.
[2024-05-20 23:43:33] [INFO ] Deduced a trap composed of 47 places in 1147 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1916 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:43:34] [INFO ] Deduced a trap composed of 56 places in 1159 ms of which 9 ms to minimize.
[2024-05-20 23:43:35] [INFO ] Deduced a trap composed of 53 places in 1109 ms of which 9 ms to minimize.
[2024-05-20 23:43:36] [INFO ] Deduced a trap composed of 53 places in 1132 ms of which 9 ms to minimize.
[2024-05-20 23:43:37] [INFO ] Deduced a trap composed of 59 places in 1161 ms of which 10 ms to minimize.
[2024-05-20 23:43:38] [INFO ] Deduced a trap composed of 60 places in 1148 ms of which 10 ms to minimize.
[2024-05-20 23:43:40] [INFO ] Deduced a trap composed of 59 places in 1164 ms of which 10 ms to minimize.
[2024-05-20 23:43:41] [INFO ] Deduced a trap composed of 58 places in 1143 ms of which 10 ms to minimize.
[2024-05-20 23:43:42] [INFO ] Deduced a trap composed of 54 places in 1080 ms of which 9 ms to minimize.
[2024-05-20 23:43:43] [INFO ] Deduced a trap composed of 49 places in 1073 ms of which 9 ms to minimize.
[2024-05-20 23:43:44] [INFO ] Deduced a trap composed of 52 places in 1052 ms of which 10 ms to minimize.
[2024-05-20 23:43:45] [INFO ] Deduced a trap composed of 53 places in 1040 ms of which 9 ms to minimize.
Detected timeout of ITS tools.
[2024-05-20 23:43:46] [INFO ] Deduced a trap composed of 56 places in 1062 ms of which 10 ms to minimize.
[2024-05-20 23:43:47] [INFO ] Deduced a trap composed of 54 places in 1027 ms of which 9 ms to minimize.
[2024-05-20 23:43:48] [INFO ] Deduced a trap composed of 50 places in 987 ms of which 9 ms to minimize.
[2024-05-20 23:43:49] [INFO ] Deduced a trap composed of 51 places in 986 ms of which 9 ms to minimize.
[2024-05-20 23:43:50] [INFO ] Deduced a trap composed of 51 places in 1000 ms of which 9 ms to minimize.
SMT process timed out in 89020ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1918 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 167 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 1918/1918 places, 6674/6674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 164 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
[2024-05-20 23:43:51] [INFO ] Invariant cache hit.
[2024-05-20 23:43:53] [INFO ] Implicit Places using invariants in 2041 ms returned []
[2024-05-20 23:43:53] [INFO ] Invariant cache hit.
[2024-05-20 23:43:54] [INFO ] State equation strengthened by 6478 read => feed constraints.
[2024-05-20 23:44:25] [INFO ] Performed 683/1918 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:44:55] [INFO ] Performed 1620/1918 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:45:05] [INFO ] Implicit Places using invariants and state equation in 72016 ms returned []
Implicit Place search using SMT with State Equation took 74058 ms to find 0 implicit places.
[2024-05-20 23:45:05] [INFO ] Redundant transitions in 515 ms returned []
Running 6634 sub problems to find dead transitions.
[2024-05-20 23:45:05] [INFO ] Invariant cache hit.
[2024-05-20 23:45:05] [INFO ] State equation strengthened by 6478 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1917 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6634 unsolved
SMT process timed out in 36626ms, After SMT, problems are : Problem set: 0 solved, 6634 unsolved
Search for dead transitions found 0 dead transitions in 36683ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111454 ms. Remains : 1918/1918 places, 6674/6674 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[40]
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-01 in 360309 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[40]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[40]
// Phase 1: matrix 6679 rows 1923 cols
[2024-05-20 23:45:42] [INFO ] Computed 42 invariants in 170 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[40]
RANDOM walk for 10000 steps (51 resets) in 110 ms. (90 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-20 23:45:42] [INFO ] Invariant cache hit.
[2024-05-20 23:45:42] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:45:42] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:45:44] [INFO ] [Real]Absence check using state equation in 1258 ms returned sat
[2024-05-20 23:45:44] [INFO ] State equation strengthened by 6344 read => feed constraints.
[2024-05-20 23:45:44] [INFO ] [Real]Added 6344 Read/Feed constraints in 488 ms returned sat
[2024-05-20 23:45:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:45:45] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:45:45] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-20 23:45:46] [INFO ] [Nat]Absence check using state equation in 1312 ms returned sat
[2024-05-20 23:45:47] [INFO ] [Nat]Added 6344 Read/Feed constraints in 582 ms returned sat
[2024-05-20 23:45:47] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 325 ms.
[2024-05-20 23:45:48] [INFO ] Added : 9 causal constraints over 2 iterations in 1158 ms. Result :sat
Minimization took 1296 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1918 transition count 6674
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 1918 transition count 6673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 1917 transition count 6673
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 1917 transition count 6673
Applied a total of 19 rules in 567 ms. Remains 1917 /1923 variables (removed 6) and now considering 6673/6679 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 568 ms. Remains : 1917/1923 places, 6673/6679 transitions.
// Phase 1: matrix 6673 rows 1917 cols
[2024-05-20 23:45:50] [INFO ] Computed 42 invariants in 147 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[40]
RANDOM walk for 1000000 steps (5170 resets) in 10911 ms. (91 steps per ms)
BEST_FIRST walk for 1000001 steps (106 resets) in 1234 ms. (809 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-20 23:46:02] [INFO ] Invariant cache hit.
[2024-05-20 23:46:02] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:46:02] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:46:04] [INFO ] [Real]Absence check using state equation in 1212 ms returned sat
[2024-05-20 23:46:04] [INFO ] State equation strengthened by 6477 read => feed constraints.
[2024-05-20 23:46:04] [INFO ] [Real]Added 6477 Read/Feed constraints in 457 ms returned sat
[2024-05-20 23:46:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:46:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 31 ms returned sat
[2024-05-20 23:46:05] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:46:06] [INFO ] [Nat]Absence check using state equation in 1194 ms returned sat
[2024-05-20 23:46:06] [INFO ] [Nat]Added 6477 Read/Feed constraints in 499 ms returned sat
[2024-05-20 23:46:07] [INFO ] Computed and/alt/rep : 4804/15469/4804 causal constraints (skipped 1829 transitions) in 320 ms.
[2024-05-20 23:46:08] [INFO ] Added : 7 causal constraints over 2 iterations in 1122 ms. Result :sat
Minimization took 5160 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 161 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 1917/1917 places, 6673/6673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 152 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
[2024-05-20 23:46:13] [INFO ] Invariant cache hit.
[2024-05-20 23:46:15] [INFO ] Implicit Places using invariants in 1989 ms returned []
[2024-05-20 23:46:15] [INFO ] Invariant cache hit.
[2024-05-20 23:46:16] [INFO ] State equation strengthened by 6477 read => feed constraints.
[2024-05-20 23:46:47] [INFO ] Performed 634/1917 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:47:17] [INFO ] Performed 1634/1917 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:47:25] [INFO ] Implicit Places using invariants and state equation in 69861 ms returned []
Implicit Place search using SMT with State Equation took 71851 ms to find 0 implicit places.
[2024-05-20 23:47:25] [INFO ] Redundant transitions in 512 ms returned []
Running 6633 sub problems to find dead transitions.
[2024-05-20 23:47:25] [INFO ] Invariant cache hit.
[2024-05-20 23:47:26] [INFO ] State equation strengthened by 6477 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 1.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 1.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 1.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 1.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 1.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 1.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 1.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 1.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 1.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 0.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 0.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1916 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6633 unsolved
SMT process timed out in 36859ms, After SMT, problems are : Problem set: 0 solved, 6633 unsolved
Search for dead transitions found 0 dead transitions in 36917ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109452 ms. Remains : 1917/1917 places, 6673/6673 transitions.
[2024-05-20 23:48:03] [INFO ] Flatten gal took : 239 ms
RANDOM walk for 40000 steps (206 resets) in 975 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
[2024-05-20 23:48:03] [INFO ] Flatten gal took : 140 ms
[2024-05-20 23:48:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18113239457605848768.gal : 21 ms
[2024-05-20 23:48:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality420579519142585756.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18113239457605848768.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality420579519142585756.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality420579519142585756.prop.
Interrupted probabilistic random walk after 125776 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 2
Probabilistic random walk after 125776 steps, saw 34265 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-20 23:48:06] [INFO ] Invariant cache hit.
[2024-05-20 23:48:06] [INFO ] State equation strengthened by 6477 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1834/1835 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 4 ms to minimize.
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 0 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 0 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 0 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 20/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1913 variables, 39/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1913 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1915 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 23:48:09] [INFO ] Deduced a trap composed of 77 places in 1508 ms of which 12 ms to minimize.
[2024-05-20 23:48:11] [INFO ] Deduced a trap composed of 48 places in 1452 ms of which 12 ms to minimize.
SMT process timed out in 5085ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 160 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 1917/1917 places, 6673/6673 transitions.
RANDOM walk for 40000 steps (206 resets) in 898 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 133838 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 1
Probabilistic random walk after 133838 steps, saw 35264 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-20 23:48:14] [INFO ] Invariant cache hit.
[2024-05-20 23:48:14] [INFO ] State equation strengthened by 6477 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1834/1835 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:48:15] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-20 23:48:15] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1913 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1913 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1915 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:48:16] [INFO ] Deduced a trap composed of 51 places in 1502 ms of which 11 ms to minimize.
[2024-05-20 23:48:17] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-05-20 23:48:17] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-05-20 23:48:17] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-05-20 23:48:17] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 1 ms to minimize.
[2024-05-20 23:48:17] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-05-20 23:48:17] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1915 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1915 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6673/8588 variables, 1915/1966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8588 variables, 6477/8443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8588 variables, 0/8443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/8590 variables, 2/8445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8590 variables, 0/8445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8590 variables, 0/8445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8590/8590 variables, and 8445 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4891 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1917/1917 constraints, ReadFeed: 6477/6477 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1834/1835 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:48:19] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-20 23:48:22] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-20 23:48:22] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:48:22] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:48:22] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:48:22] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-20 23:48:22] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-20 23:48:22] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1835 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1835 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1913 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1913 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1915 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1915 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:48:24] [INFO ] Deduced a trap composed of 45 places in 1472 ms of which 11 ms to minimize.
[2024-05-20 23:48:25] [INFO ] Deduced a trap composed of 77 places in 1558 ms of which 11 ms to minimize.
[2024-05-20 23:48:27] [INFO ] Deduced a trap composed of 50 places in 1505 ms of which 12 ms to minimize.
[2024-05-20 23:48:28] [INFO ] Deduced a trap composed of 50 places in 1543 ms of which 12 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1696
[2024-05-20 23:48:30] [INFO ] Deduced a trap composed of 54 places in 1530 ms of which 11 ms to minimize.
[2024-05-20 23:48:31] [INFO ] Deduced a trap composed of 55 places in 1496 ms of which 11 ms to minimize.
[2024-05-20 23:48:33] [INFO ] Deduced a trap composed of 48 places in 1481 ms of which 12 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1696 after 1820
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1820 after 2026
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2026 after 2364
[2024-05-20 23:48:35] [INFO ] Deduced a trap composed of 45 places in 1504 ms of which 12 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2364 after 2806
[2024-05-20 23:48:36] [INFO ] Deduced a trap composed of 62 places in 1564 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2806 after 3181
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3181 after 3251
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3251 after 3281
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3281 after 3361
[2024-05-20 23:48:38] [INFO ] Deduced a trap composed of 56 places in 1555 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3361 after 3566
[2024-05-20 23:48:39] [INFO ] Deduced a trap composed of 57 places in 1515 ms of which 11 ms to minimize.
[2024-05-20 23:48:41] [INFO ] Deduced a trap composed of 66 places in 1572 ms of which 11 ms to minimize.
[2024-05-20 23:48:42] [INFO ] Deduced a trap composed of 59 places in 1437 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3566 after 3848
[2024-05-20 23:48:44] [INFO ] Deduced a trap composed of 45 places in 1537 ms of which 12 ms to minimize.
[2024-05-20 23:48:45] [INFO ] Deduced a trap composed of 51 places in 1420 ms of which 11 ms to minimize.
[2024-05-20 23:48:47] [INFO ] Deduced a trap composed of 58 places in 1484 ms of which 11 ms to minimize.
[2024-05-20 23:48:48] [INFO ] Deduced a trap composed of 58 places in 1480 ms of which 12 ms to minimize.
[2024-05-20 23:48:50] [INFO ] Deduced a trap composed of 52 places in 1475 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3848 after 4346
[2024-05-20 23:48:51] [INFO ] Deduced a trap composed of 81 places in 1491 ms of which 11 ms to minimize.
[2024-05-20 23:48:53] [INFO ] Deduced a trap composed of 46 places in 1440 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1915 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
[2024-05-20 23:48:53] [INFO ] Flatten gal took : 121 ms
[2024-05-20 23:48:53] [INFO ] Applying decomposition
[2024-05-20 23:48:53] [INFO ] Flatten gal took : 122 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/graph7768959705302045429.txt' '-o' '/tmp/graph7768959705302045429.bin' '-w' '/tmp/graph7768959705302045429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7768959705302045429.bin' '-l' '-1' '-v' '-w' '/tmp/graph7768959705302045429.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:48:53] [INFO ] Decomposing Gal with order
[2024-05-20 23:48:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:48:54] [INFO ] Removed a total of 4993 redundant transitions.
[2024-05-20 23:48:54] [INFO ] Flatten gal took : 347 ms
[2024-05-20 23:48:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 6162 labels/synchronizations in 244 ms.
[2024-05-20 23:48:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16236990149583298354.gal : 40 ms
[2024-05-20 23:48:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18275994562277630899.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16236990149583298354.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18275994562277630899.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality18275994562277630899.prop.
[2024-05-20 23:48:55] [INFO ] Deduced a trap composed of 58 places in 2321 ms of which 12 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 90
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :90 after 90
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :90 after 90
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :90 after 90
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :90 after 90
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :90 after 90
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :90 after 90
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :90 after 90
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :90 after 90
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :90 after 90
[2024-05-20 23:48:57] [INFO ] Deduced a trap composed of 55 places in 1538 ms of which 12 ms to minimize.
[2024-05-20 23:48:58] [INFO ] Deduced a trap composed of 46 places in 1514 ms of which 11 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :90 after 2499
[2024-05-20 23:49:00] [INFO ] Deduced a trap composed of 45 places in 1560 ms of which 11 ms to minimize.
[2024-05-20 23:49:01] [INFO ] Deduced a trap composed of 49 places in 1577 ms of which 11 ms to minimize.
[2024-05-20 23:49:03] [INFO ] Deduced a trap composed of 49 places in 1615 ms of which 11 ms to minimize.
[2024-05-20 23:49:05] [INFO ] Deduced a trap composed of 44 places in 1657 ms of which 11 ms to minimize.
SMT process timed out in 50568ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 158 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 1917/1917 places, 6673/6673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 155 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
[2024-05-20 23:49:05] [INFO ] Invariant cache hit.
[2024-05-20 23:49:07] [INFO ] Implicit Places using invariants in 1977 ms returned []
[2024-05-20 23:49:07] [INFO ] Invariant cache hit.
[2024-05-20 23:49:09] [INFO ] State equation strengthened by 6477 read => feed constraints.
[2024-05-20 23:49:39] [INFO ] Performed 666/1917 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2024-05-20 23:50:09] [INFO ] Performed 1696/1917 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:50:15] [INFO ] Implicit Places using invariants and state equation in 68216 ms returned []
Implicit Place search using SMT with State Equation took 70211 ms to find 0 implicit places.
[2024-05-20 23:50:16] [INFO ] Redundant transitions in 514 ms returned []
Running 6633 sub problems to find dead transitions.
[2024-05-20 23:50:16] [INFO ] Invariant cache hit.
[2024-05-20 23:50:16] [INFO ] State equation strengthened by 6477 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1916 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6633 unsolved
SMT process timed out in 36749ms, After SMT, problems are : Problem set: 0 solved, 6633 unsolved
Search for dead transitions found 0 dead transitions in 36805ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107707 ms. Remains : 1917/1917 places, 6673/6673 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[40]
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-02 in 310738 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[40]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[40]
// Phase 1: matrix 6679 rows 1923 cols
[2024-05-20 23:50:53] [INFO ] Computed 42 invariants in 171 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[40]
RANDOM walk for 10000 steps (51 resets) in 111 ms. (89 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-20 23:50:53] [INFO ] Invariant cache hit.
[2024-05-20 23:50:53] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2024-05-20 23:50:53] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:50:54] [INFO ] [Real]Absence check using state equation in 1212 ms returned sat
[2024-05-20 23:50:55] [INFO ] State equation strengthened by 6344 read => feed constraints.
[2024-05-20 23:50:55] [INFO ] [Real]Added 6344 Read/Feed constraints in 489 ms returned sat
[2024-05-20 23:50:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:50:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:50:55] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-20 23:50:57] [INFO ] [Nat]Absence check using state equation in 1201 ms returned sat
[2024-05-20 23:50:57] [INFO ] [Nat]Added 6344 Read/Feed constraints in 544 ms returned sat
[2024-05-20 23:50:58] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 327 ms.
[2024-05-20 23:50:58] [INFO ] Added : 7 causal constraints over 2 iterations in 1109 ms. Result :sat
Minimization took 1273 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1919 transition count 6675
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 1919 transition count 6674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 1918 transition count 6674
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 1918 transition count 6674
Applied a total of 18 rules in 572 ms. Remains 1918 /1923 variables (removed 5) and now considering 6674/6679 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 573 ms. Remains : 1918/1923 places, 6674/6679 transitions.
// Phase 1: matrix 6674 rows 1918 cols
[2024-05-20 23:51:00] [INFO ] Computed 42 invariants in 153 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[40]
RANDOM walk for 1000000 steps (5167 resets) in 10777 ms. (92 steps per ms)
BEST_FIRST walk for 1000001 steps (106 resets) in 1293 ms. (772 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-20 23:51:13] [INFO ] Invariant cache hit.
[2024-05-20 23:51:13] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2024-05-20 23:51:13] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:51:14] [INFO ] [Real]Absence check using state equation in 1176 ms returned sat
[2024-05-20 23:51:14] [INFO ] State equation strengthened by 6476 read => feed constraints.
[2024-05-20 23:51:15] [INFO ] [Real]Added 6476 Read/Feed constraints in 497 ms returned sat
[2024-05-20 23:51:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:51:15] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:51:15] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:51:16] [INFO ] [Nat]Absence check using state equation in 1160 ms returned sat
[2024-05-20 23:51:17] [INFO ] [Nat]Added 6476 Read/Feed constraints in 507 ms returned sat
[2024-05-20 23:51:17] [INFO ] Computed and/alt/rep : 4805/15465/4805 causal constraints (skipped 1829 transitions) in 323 ms.
[2024-05-20 23:51:18] [INFO ] Added : 7 causal constraints over 2 iterations in 1129 ms. Result :sat
Minimization took 5162 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1918 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 163 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 1918/1918 places, 6674/6674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 154 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
[2024-05-20 23:51:23] [INFO ] Invariant cache hit.
[2024-05-20 23:51:25] [INFO ] Implicit Places using invariants in 1958 ms returned []
[2024-05-20 23:51:25] [INFO ] Invariant cache hit.
[2024-05-20 23:51:27] [INFO ] State equation strengthened by 6476 read => feed constraints.
[2024-05-20 23:51:57] [INFO ] Performed 772/1918 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:52:27] [INFO ] Performed 1866/1918 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:52:29] [INFO ] Implicit Places using invariants and state equation in 63277 ms returned []
Implicit Place search using SMT with State Equation took 65236 ms to find 0 implicit places.
[2024-05-20 23:52:29] [INFO ] Redundant transitions in 532 ms returned []
Running 6634 sub problems to find dead transitions.
[2024-05-20 23:52:29] [INFO ] Invariant cache hit.
[2024-05-20 23:52:29] [INFO ] State equation strengthened by 6476 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1917 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6634 unsolved
SMT process timed out in 36693ms, After SMT, problems are : Problem set: 0 solved, 6634 unsolved
Search for dead transitions found 0 dead transitions in 36745ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102685 ms. Remains : 1918/1918 places, 6674/6674 transitions.
[2024-05-20 23:53:06] [INFO ] Flatten gal took : 224 ms
RANDOM walk for 40000 steps (207 resets) in 1365 ms. (29 steps per ms) remains 2/2 properties
[2024-05-20 23:53:06] [INFO ] Flatten gal took : 156 ms
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
[2024-05-20 23:53:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16745352095241673250.gal : 30 ms
[2024-05-20 23:53:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality264628368260494561.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16745352095241673250.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality264628368260494561.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality264628368260494561.prop.
Interrupted probabilistic random walk after 124210 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 2
Probabilistic random walk after 124210 steps, saw 34066 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-20 23:53:09] [INFO ] Invariant cache hit.
[2024-05-20 23:53:09] [INFO ] State equation strengthened by 6476 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1835/1836 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:53:10] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-20 23:53:10] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:53:10] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-20 23:53:10] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:53:10] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:53:10] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:53:10] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-20 23:53:10] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:53:10] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:53:10] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:53:10] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:53:10] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:53:11] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:53:11] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:53:11] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-20 23:53:11] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:53:11] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:53:11] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:53:11] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-20 23:53:11] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1836 variables, 20/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1836 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1914 variables, 39/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1914 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1916 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 23:53:13] [INFO ] Deduced a trap composed of 46 places in 1527 ms of which 12 ms to minimize.
[2024-05-20 23:53:14] [INFO ] Deduced a trap composed of 53 places in 1457 ms of which 11 ms to minimize.
SMT process timed out in 5076ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1918 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 159 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 1918/1918 places, 6674/6674 transitions.
RANDOM walk for 40000 steps (204 resets) in 642 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 133651 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 1
Probabilistic random walk after 133651 steps, saw 35247 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-20 23:53:18] [INFO ] Invariant cache hit.
[2024-05-20 23:53:18] [INFO ] State equation strengthened by 6476 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1835/1836 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:53:18] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1836 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1836 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1914 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1914 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1916 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:53:20] [INFO ] Deduced a trap composed of 56 places in 1517 ms of which 12 ms to minimize.
[2024-05-20 23:53:21] [INFO ] Deduced a trap composed of 56 places in 1487 ms of which 11 ms to minimize.
[2024-05-20 23:53:23] [INFO ] Deduced a trap composed of 51 places in 1474 ms of which 11 ms to minimize.
[2024-05-20 23:53:24] [INFO ] Deduced a trap composed of 45 places in 1408 ms of which 11 ms to minimize.
[2024-05-20 23:53:26] [INFO ] Deduced a trap composed of 62 places in 1374 ms of which 11 ms to minimize.
[2024-05-20 23:53:27] [INFO ] Deduced a trap composed of 60 places in 1399 ms of which 11 ms to minimize.
[2024-05-20 23:53:29] [INFO ] Deduced a trap composed of 60 places in 1334 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1696
[2024-05-20 23:53:30] [INFO ] Deduced a trap composed of 56 places in 1336 ms of which 10 ms to minimize.
[2024-05-20 23:53:31] [INFO ] Deduced a trap composed of 50 places in 1308 ms of which 10 ms to minimize.
[2024-05-20 23:53:33] [INFO ] Deduced a trap composed of 56 places in 1239 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1696 after 1820
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1820 after 2026
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2026 after 2364
[2024-05-20 23:53:34] [INFO ] Deduced a trap composed of 60 places in 1254 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2364 after 2835
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2835 after 3198
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3198 after 3250
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3250 after 3280
[2024-05-20 23:53:35] [INFO ] Deduced a trap composed of 45 places in 1226 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3280 after 3360
[2024-05-20 23:53:36] [INFO ] Deduced a trap composed of 53 places in 1165 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3360 after 3565
[2024-05-20 23:53:38] [INFO ] Deduced a trap composed of 53 places in 1209 ms of which 10 ms to minimize.
[2024-05-20 23:53:39] [INFO ] Deduced a trap composed of 52 places in 1201 ms of which 10 ms to minimize.
[2024-05-20 23:53:40] [INFO ] Deduced a trap composed of 50 places in 1133 ms of which 10 ms to minimize.
[2024-05-20 23:53:41] [INFO ] Deduced a trap composed of 52 places in 1139 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3565 after 3847
[2024-05-20 23:53:42] [INFO ] Deduced a trap composed of 57 places in 1268 ms of which 9 ms to minimize.
[2024-05-20 23:53:43] [INFO ] Deduced a trap composed of 55 places in 1035 ms of which 9 ms to minimize.
[2024-05-20 23:53:45] [INFO ] Deduced a trap composed of 55 places in 1039 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1916 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:53:46] [INFO ] Deduced a trap composed of 59 places in 1031 ms of which 9 ms to minimize.
[2024-05-20 23:53:47] [INFO ] Deduced a trap composed of 61 places in 1031 ms of which 9 ms to minimize.
[2024-05-20 23:53:48] [INFO ] Deduced a trap composed of 59 places in 1030 ms of which 9 ms to minimize.
[2024-05-20 23:53:49] [INFO ] Deduced a trap composed of 61 places in 1023 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3847 after 4345
[2024-05-20 23:53:50] [INFO ] Deduced a trap composed of 56 places in 1021 ms of which 9 ms to minimize.
[2024-05-20 23:53:51] [INFO ] Deduced a trap composed of 63 places in 1017 ms of which 9 ms to minimize.
[2024-05-20 23:53:52] [INFO ] Deduced a trap composed of 59 places in 971 ms of which 9 ms to minimize.
[2024-05-20 23:53:53] [INFO ] Deduced a trap composed of 52 places in 968 ms of which 8 ms to minimize.
[2024-05-20 23:53:54] [INFO ] Deduced a trap composed of 54 places in 968 ms of which 8 ms to minimize.
[2024-05-20 23:53:55] [INFO ] Deduced a trap composed of 61 places in 963 ms of which 8 ms to minimize.
[2024-05-20 23:53:56] [INFO ] Deduced a trap composed of 56 places in 964 ms of which 9 ms to minimize.
Detected timeout of ITS tools.
[2024-05-20 23:53:57] [INFO ] Flatten gal took : 121 ms
[2024-05-20 23:53:57] [INFO ] Applying decomposition
[2024-05-20 23:53:57] [INFO ] Flatten gal took : 126 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/graph15182948325634769168.txt' '-o' '/tmp/graph15182948325634769168.bin' '-w' '/tmp/graph15182948325634769168.weights'
[2024-05-20 23:53:57] [INFO ] Deduced a trap composed of 55 places in 962 ms of which 8 ms to minimize.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15182948325634769168.bin' '-l' '-1' '-v' '-w' '/tmp/graph15182948325634769168.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:53:57] [INFO ] Decomposing Gal with order
[2024-05-20 23:53:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:53:57] [INFO ] Removed a total of 5064 redundant transitions.
[2024-05-20 23:53:57] [INFO ] Flatten gal took : 337 ms
[2024-05-20 23:53:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 6232 labels/synchronizations in 240 ms.
[2024-05-20 23:53:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12177058870544177598.gal : 39 ms
[2024-05-20 23:53:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6559361547446620986.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12177058870544177598.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6559361547446620986.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2024-05-20 23:53:58] [INFO ] Deduced a trap composed of 56 places in 841 ms of which 8 ms to minimize.
Loading property file /tmp/ReachabilityCardinality6559361547446620986.prop.
[2024-05-20 23:53:59] [INFO ] Deduced a trap composed of 45 places in 911 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 5
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5 after 5
[2024-05-20 23:54:00] [INFO ] Deduced a trap composed of 53 places in 824 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5 after 2377
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2377 after 2377
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2377 after 2377
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2377 after 2377
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2377 after 2377
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2377 after 2377
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2377 after 2377
[2024-05-20 23:54:00] [INFO ] Deduced a trap composed of 50 places in 836 ms of which 8 ms to minimize.
[2024-05-20 23:54:01] [INFO ] Deduced a trap composed of 56 places in 782 ms of which 7 ms to minimize.
[2024-05-20 23:54:02] [INFO ] Deduced a trap composed of 57 places in 772 ms of which 7 ms to minimize.
[2024-05-20 23:54:03] [INFO ] Deduced a trap composed of 57 places in 782 ms of which 10 ms to minimize.
SMT process timed out in 45093ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1918 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 157 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 1918/1918 places, 6674/6674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 157 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
[2024-05-20 23:54:03] [INFO ] Invariant cache hit.
[2024-05-20 23:54:05] [INFO ] Implicit Places using invariants in 2125 ms returned []
[2024-05-20 23:54:05] [INFO ] Invariant cache hit.
[2024-05-20 23:54:07] [INFO ] State equation strengthened by 6476 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2377 after 1.78848e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.78848e+06 after 3.21321e+06
[2024-05-20 23:54:37] [INFO ] Performed 663/1918 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2024-05-20 23:55:07] [INFO ] Performed 1613/1918 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:55:16] [INFO ] Implicit Places using invariants and state equation in 70742 ms returned []
Implicit Place search using SMT with State Equation took 72870 ms to find 0 implicit places.
[2024-05-20 23:55:17] [INFO ] Redundant transitions in 517 ms returned []
Running 6634 sub problems to find dead transitions.
[2024-05-20 23:55:17] [INFO ] Invariant cache hit.
[2024-05-20 23:55:17] [INFO ] State equation strengthened by 6476 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1917 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6634 unsolved
SMT process timed out in 37849ms, After SMT, problems are : Problem set: 0 solved, 6634 unsolved
Search for dead transitions found 0 dead transitions in 37916ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111482 ms. Remains : 1918/1918 places, 6674/6674 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[40]
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-03 in 301876 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[40]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[40]
// Phase 1: matrix 6679 rows 1923 cols
[2024-05-20 23:55:55] [INFO ] Computed 42 invariants in 161 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[40]
RANDOM walk for 10000 steps (49 resets) in 114 ms. (86 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[40]
[2024-05-20 23:55:55] [INFO ] Invariant cache hit.
[2024-05-20 23:55:55] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:55:55] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-20 23:55:56] [INFO ] [Real]Absence check using state equation in 1324 ms returned sat
[2024-05-20 23:55:57] [INFO ] State equation strengthened by 6344 read => feed constraints.
[2024-05-20 23:55:57] [INFO ] [Real]Added 6344 Read/Feed constraints in 463 ms returned sat
[2024-05-20 23:55:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:55:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2024-05-20 23:55:57] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:55:59] [INFO ] [Nat]Absence check using state equation in 1365 ms returned sat
[2024-05-20 23:55:59] [INFO ] [Nat]Added 6344 Read/Feed constraints in 488 ms returned sat
[2024-05-20 23:56:00] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 375 ms.
[2024-05-20 23:56:00] [INFO ] Added : 0 causal constraints over 0 iterations in 785 ms. Result :sat
Minimization took 1285 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[40]
Support contains 1 out of 1923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1918 transition count 6674
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 1918 transition count 6673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 1917 transition count 6673
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 1917 transition count 6673
Applied a total of 19 rules in 604 ms. Remains 1917 /1923 variables (removed 6) and now considering 6673/6679 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 605 ms. Remains : 1917/1923 places, 6673/6679 transitions.
// Phase 1: matrix 6673 rows 1917 cols
[2024-05-20 23:56:02] [INFO ] Computed 42 invariants in 157 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[40]
RANDOM walk for 1000000 steps (5170 resets) in 11615 ms. (86 steps per ms)
BEST_FIRST walk for 1000000 steps (106 resets) in 1241 ms. (805 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-20 23:56:15] [INFO ] Invariant cache hit.
[2024-05-20 23:56:15] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 23:56:15] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:56:17] [INFO ] [Real]Absence check using state equation in 1196 ms returned sat
[2024-05-20 23:56:17] [INFO ] State equation strengthened by 6477 read => feed constraints.
[2024-05-20 23:56:17] [INFO ] [Real]Added 6477 Read/Feed constraints in 468 ms returned sat
[2024-05-20 23:56:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:56:18] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:56:18] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-20 23:56:19] [INFO ] [Nat]Absence check using state equation in 1173 ms returned sat
[2024-05-20 23:56:19] [INFO ] [Nat]Added 6477 Read/Feed constraints in 517 ms returned sat
[2024-05-20 23:56:20] [INFO ] Computed and/alt/rep : 4804/15469/4804 causal constraints (skipped 1829 transitions) in 325 ms.
[2024-05-20 23:56:20] [INFO ] Added : 7 causal constraints over 2 iterations in 1141 ms. Result :sat
Minimization took 5147 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 163 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 1917/1917 places, 6673/6673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 164 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
[2024-05-20 23:56:26] [INFO ] Invariant cache hit.
[2024-05-20 23:56:28] [INFO ] Implicit Places using invariants in 1970 ms returned []
[2024-05-20 23:56:28] [INFO ] Invariant cache hit.
[2024-05-20 23:56:29] [INFO ] State equation strengthened by 6477 read => feed constraints.
[2024-05-20 23:57:00] [INFO ] Performed 715/1917 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:57:30] [INFO ] Performed 1774/1917 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:57:33] [INFO ] Implicit Places using invariants and state equation in 65552 ms returned []
Implicit Place search using SMT with State Equation took 67523 ms to find 0 implicit places.
[2024-05-20 23:57:34] [INFO ] Redundant transitions in 516 ms returned []
Running 6633 sub problems to find dead transitions.
[2024-05-20 23:57:34] [INFO ] Invariant cache hit.
[2024-05-20 23:57:34] [INFO ] State equation strengthened by 6477 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1916 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6633 unsolved
SMT process timed out in 36914ms, After SMT, problems are : Problem set: 0 solved, 6633 unsolved
Search for dead transitions found 0 dead transitions in 36969ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105189 ms. Remains : 1917/1917 places, 6673/6673 transitions.
[2024-05-20 23:58:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[40]
RANDOM walk for 1000000 steps (5174 resets) in 11323 ms. (88 steps per ms)
BEST_FIRST walk for 1000001 steps (110 resets) in 1263 ms. (791 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-20 23:58:24] [INFO ] Invariant cache hit.
[2024-05-20 23:58:24] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:58:24] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 23:58:25] [INFO ] [Real]Absence check using state equation in 1197 ms returned sat
[2024-05-20 23:58:25] [INFO ] State equation strengthened by 6477 read => feed constraints.
[2024-05-20 23:58:26] [INFO ] [Real]Added 6477 Read/Feed constraints in 485 ms returned sat
[2024-05-20 23:58:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:58:26] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 23:58:26] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 23:58:27] [INFO ] [Nat]Absence check using state equation in 1185 ms returned sat
[2024-05-20 23:58:28] [INFO ] [Nat]Added 6477 Read/Feed constraints in 538 ms returned sat
[2024-05-20 23:58:28] [INFO ] Computed and/alt/rep : 4804/15469/4804 causal constraints (skipped 1829 transitions) in 330 ms.
[2024-05-20 23:58:29] [INFO ] Added : 7 causal constraints over 2 iterations in 1174 ms. Result :sat
Minimization took 5150 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 166 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 1917/1917 places, 6673/6673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 153 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
[2024-05-20 23:58:35] [INFO ] Invariant cache hit.
[2024-05-20 23:58:36] [INFO ] Implicit Places using invariants in 1921 ms returned []
[2024-05-20 23:58:36] [INFO ] Invariant cache hit.
[2024-05-20 23:58:38] [INFO ] State equation strengthened by 6477 read => feed constraints.
[2024-05-20 23:59:08] [INFO ] Performed 797/1917 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:59:38] [INFO ] Performed 1891/1917 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:59:39] [INFO ] Implicit Places using invariants and state equation in 62651 ms returned []
Implicit Place search using SMT with State Equation took 64574 ms to find 0 implicit places.
[2024-05-20 23:59:40] [INFO ] Redundant transitions in 521 ms returned []
Running 6633 sub problems to find dead transitions.
[2024-05-20 23:59:40] [INFO ] Invariant cache hit.
[2024-05-20 23:59:40] [INFO ] State equation strengthened by 6477 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1916 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6633 unsolved
SMT process timed out in 36990ms, After SMT, problems are : Problem set: 0 solved, 6633 unsolved
Search for dead transitions found 0 dead transitions in 37048ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102310 ms. Remains : 1917/1917 places, 6673/6673 transitions.
[2024-05-21 00:00:17] [INFO ] Flatten gal took : 129 ms
RANDOM walk for 40000 steps (204 resets) in 791 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
[2024-05-21 00:00:17] [INFO ] Flatten gal took : 147 ms
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
[2024-05-21 00:00:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2320675010523994870.gal : 25 ms
[2024-05-21 00:00:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6312841448162887342.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2320675010523994870.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6312841448162887342.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6312841448162887342.prop.
Interrupted probabilistic random walk after 120083 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 120083 steps, saw 33521 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-21 00:00:20] [INFO ] Invariant cache hit.
[2024-05-21 00:00:20] [INFO ] State equation strengthened by 6477 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1834/1835 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 00:00:20] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-21 00:00:20] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-21 00:00:22] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-21 00:00:22] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 00:00:22] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-21 00:00:22] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-21 00:00:22] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 20/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1913 variables, 39/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1913 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1915 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:00:24] [INFO ] Deduced a trap composed of 45 places in 1599 ms of which 11 ms to minimize.
[2024-05-21 00:00:24] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1915 variables, 2/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1915 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8588/8590 variables, and 1979 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1915/1917 constraints, ReadFeed: 0/6477 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1834/1835 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 20/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:00:25] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 00:00:27] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-21 00:00:27] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-21 00:00:27] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 19/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1835 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 78/1913 variables, 39/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1913 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1915 variables, 2/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1915 variables, 2/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:00:29] [INFO ] Deduced a trap composed of 50 places in 1586 ms of which 11 ms to minimize.
[2024-05-21 00:00:30] [INFO ] Deduced a trap composed of 51 places in 1558 ms of which 12 ms to minimize.
[2024-05-21 00:00:32] [INFO ] Deduced a trap composed of 50 places in 1585 ms of which 12 ms to minimize.
SMT process timed out in 11674ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 166 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 1917/1917 places, 6673/6673 transitions.
RANDOM walk for 40000 steps (203 resets) in 559 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 126952 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 1
Probabilistic random walk after 126952 steps, saw 34402 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-21 00:00:35] [INFO ] Invariant cache hit.
[2024-05-21 00:00:35] [INFO ] State equation strengthened by 6477 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1834/1835 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:00:35] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2024-05-21 00:00:36] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1913 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1913 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1915 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:00:37] [INFO ] Deduced a trap composed of 62 places in 1637 ms of which 12 ms to minimize.
[2024-05-21 00:00:39] [INFO ] Deduced a trap composed of 46 places in 1553 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1915 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1915 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1696
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6673/8588 variables, 1915/1961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8588 variables, 6477/8438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8588 variables, 0/8438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/8590 variables, 2/8440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8590 variables, 0/8440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8590 variables, 0/8440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8590/8590 variables, and 8440 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6548 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1917/1917 constraints, ReadFeed: 6477/6477 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1834/1835 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:00:42] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-21 00:00:42] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-21 00:00:42] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 00:00:42] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:00:42] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:00:42] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 00:00:42] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1696 after 1820
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1820 after 2026
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2026 after 2364
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1835 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1835 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1913 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1913 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1915 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1915 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2364 after 2835
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2835 after 3198
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3198 after 3250
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3250 after 3280
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3280 after 3360
[2024-05-21 00:00:46] [INFO ] Deduced a trap composed of 52 places in 1537 ms of which 12 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3360 after 3565
[2024-05-21 00:00:48] [INFO ] Deduced a trap composed of 49 places in 1516 ms of which 12 ms to minimize.
[2024-05-21 00:00:49] [INFO ] Deduced a trap composed of 46 places in 1492 ms of which 12 ms to minimize.
[2024-05-21 00:00:51] [INFO ] Deduced a trap composed of 52 places in 1480 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3565 after 3847
[2024-05-21 00:00:52] [INFO ] Deduced a trap composed of 52 places in 1546 ms of which 12 ms to minimize.
[2024-05-21 00:00:54] [INFO ] Deduced a trap composed of 88 places in 1539 ms of which 11 ms to minimize.
[2024-05-21 00:00:56] [INFO ] Deduced a trap composed of 48 places in 1533 ms of which 12 ms to minimize.
[2024-05-21 00:00:57] [INFO ] Deduced a trap composed of 53 places in 1529 ms of which 12 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3847 after 4346
[2024-05-21 00:00:59] [INFO ] Deduced a trap composed of 57 places in 1520 ms of which 11 ms to minimize.
[2024-05-21 00:01:00] [INFO ] Deduced a trap composed of 48 places in 1476 ms of which 12 ms to minimize.
[2024-05-21 00:01:02] [INFO ] Deduced a trap composed of 56 places in 1467 ms of which 12 ms to minimize.
[2024-05-21 00:01:03] [INFO ] Deduced a trap composed of 50 places in 1493 ms of which 11 ms to minimize.
[2024-05-21 00:01:05] [INFO ] Deduced a trap composed of 45 places in 1518 ms of which 12 ms to minimize.
[2024-05-21 00:01:06] [INFO ] Deduced a trap composed of 49 places in 1523 ms of which 12 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 00:01:07] [INFO ] Flatten gal took : 118 ms
[2024-05-21 00:01:07] [INFO ] Applying decomposition
[2024-05-21 00:01:07] [INFO ] Flatten gal took : 121 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/graph18164155679563826648.txt' '-o' '/tmp/graph18164155679563826648.bin' '-w' '/tmp/graph18164155679563826648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18164155679563826648.bin' '-l' '-1' '-v' '-w' '/tmp/graph18164155679563826648.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:01:08] [INFO ] Decomposing Gal with order
[2024-05-21 00:01:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:01:08] [INFO ] Deduced a trap composed of 80 places in 1615 ms of which 12 ms to minimize.
[2024-05-21 00:01:08] [INFO ] Removed a total of 4990 redundant transitions.
[2024-05-21 00:01:08] [INFO ] Flatten gal took : 402 ms
[2024-05-21 00:01:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 6051 labels/synchronizations in 235 ms.
[2024-05-21 00:01:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17454948359683898614.gal : 38 ms
[2024-05-21 00:01:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8157958908717919468.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17454948359683898614.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8157958908717919468.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8157958908717919468.prop.
[2024-05-21 00:01:10] [INFO ] Deduced a trap composed of 50 places in 1547 ms of which 11 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :10 after 418
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :418 after 418
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :418 after 418
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :418 after 418
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :418 after 418
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :418 after 418
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :418 after 418
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :418 after 418
[2024-05-21 00:01:11] [INFO ] Deduced a trap composed of 50 places in 1471 ms of which 12 ms to minimize.
[2024-05-21 00:01:13] [INFO ] Deduced a trap composed of 53 places in 1498 ms of which 11 ms to minimize.
[2024-05-21 00:01:14] [INFO ] Deduced a trap composed of 51 places in 1523 ms of which 12 ms to minimize.
[2024-05-21 00:01:16] [INFO ] Deduced a trap composed of 62 places in 1615 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1915 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:01:17] [INFO ] Deduced a trap composed of 66 places in 1560 ms of which 11 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :418 after 86488
[2024-05-21 00:01:19] [INFO ] Deduced a trap composed of 47 places in 1552 ms of which 12 ms to minimize.
[2024-05-21 00:01:21] [INFO ] Deduced a trap composed of 54 places in 1694 ms of which 11 ms to minimize.
[2024-05-21 00:01:22] [INFO ] Deduced a trap composed of 55 places in 1508 ms of which 11 ms to minimize.
[2024-05-21 00:01:24] [INFO ] Deduced a trap composed of 50 places in 1490 ms of which 11 ms to minimize.
[2024-05-21 00:01:25] [INFO ] Deduced a trap composed of 51 places in 1517 ms of which 11 ms to minimize.
[2024-05-21 00:01:27] [INFO ] Deduced a trap composed of 47 places in 1477 ms of which 12 ms to minimize.
[2024-05-21 00:01:28] [INFO ] Deduced a trap composed of 53 places in 1564 ms of which 12 ms to minimize.
SMT process timed out in 53199ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 169 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 1917/1917 places, 6673/6673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 160 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
[2024-05-21 00:01:29] [INFO ] Invariant cache hit.
[2024-05-21 00:01:31] [INFO ] Implicit Places using invariants in 2037 ms returned []
[2024-05-21 00:01:31] [INFO ] Invariant cache hit.
[2024-05-21 00:01:32] [INFO ] State equation strengthened by 6477 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-21 00:02:03] [INFO ] Performed 729/1917 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 00:02:33] [INFO ] Performed 1777/1917 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-21 00:02:37] [INFO ] Implicit Places using invariants and state equation in 65946 ms returned []
Implicit Place search using SMT with State Equation took 67998 ms to find 0 implicit places.
[2024-05-21 00:02:37] [INFO ] Redundant transitions in 531 ms returned []
Running 6633 sub problems to find dead transitions.
[2024-05-21 00:02:37] [INFO ] Invariant cache hit.
[2024-05-21 00:02:37] [INFO ] State equation strengthened by 6477 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1916 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6633 unsolved
SMT process timed out in 36923ms, After SMT, problems are : Problem set: 0 solved, 6633 unsolved
Search for dead transitions found 0 dead transitions in 36980ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105687 ms. Remains : 1917/1917 places, 6673/6673 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[40]
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-04 in 439619 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[40]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[40]
// Phase 1: matrix 6679 rows 1923 cols
[2024-05-21 00:03:14] [INFO ] Computed 42 invariants in 160 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[40]
RANDOM walk for 10000 steps (51 resets) in 113 ms. (87 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-21 00:03:14] [INFO ] Invariant cache hit.
[2024-05-21 00:03:15] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-21 00:03:15] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-21 00:03:16] [INFO ] [Real]Absence check using state equation in 1268 ms returned sat
[2024-05-21 00:03:16] [INFO ] State equation strengthened by 6344 read => feed constraints.
[2024-05-21 00:03:17] [INFO ] [Real]Added 6344 Read/Feed constraints in 515 ms returned sat
[2024-05-21 00:03:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:03:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-21 00:03:17] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-21 00:03:18] [INFO ] [Nat]Absence check using state equation in 1230 ms returned sat
[2024-05-21 00:03:19] [INFO ] [Nat]Added 6344 Read/Feed constraints in 619 ms returned sat
[2024-05-21 00:03:19] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 323 ms.
[2024-05-21 00:03:20] [INFO ] Added : 10 causal constraints over 2 iterations in 1127 ms. Result :sat
Minimization took 1270 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1919 transition count 6675
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 1919 transition count 6674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 1918 transition count 6674
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 1918 transition count 6674
Applied a total of 18 rules in 573 ms. Remains 1918 /1923 variables (removed 5) and now considering 6674/6679 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 574 ms. Remains : 1918/1923 places, 6674/6679 transitions.
// Phase 1: matrix 6674 rows 1918 cols
[2024-05-21 00:03:22] [INFO ] Computed 42 invariants in 158 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[40]
RANDOM walk for 1000000 steps (5167 resets) in 10785 ms. (92 steps per ms)
BEST_FIRST walk for 1000001 steps (108 resets) in 1228 ms. (813 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-21 00:03:34] [INFO ] Invariant cache hit.
[2024-05-21 00:03:34] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-21 00:03:34] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-21 00:03:36] [INFO ] [Real]Absence check using state equation in 1181 ms returned sat
[2024-05-21 00:03:36] [INFO ] State equation strengthened by 6476 read => feed constraints.
[2024-05-21 00:03:36] [INFO ] [Real]Added 6476 Read/Feed constraints in 494 ms returned sat
[2024-05-21 00:03:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:03:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-21 00:03:37] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-21 00:03:38] [INFO ] [Nat]Absence check using state equation in 1176 ms returned sat
[2024-05-21 00:03:38] [INFO ] [Nat]Added 6476 Read/Feed constraints in 530 ms returned sat
[2024-05-21 00:03:39] [INFO ] Computed and/alt/rep : 4805/15465/4805 causal constraints (skipped 1829 transitions) in 320 ms.
[2024-05-21 00:03:40] [INFO ] Added : 8 causal constraints over 2 iterations in 1217 ms. Result :sat
Minimization took 5147 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1918 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 160 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 1918/1918 places, 6674/6674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 154 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
[2024-05-21 00:03:45] [INFO ] Invariant cache hit.
[2024-05-21 00:03:47] [INFO ] Implicit Places using invariants in 1979 ms returned []
[2024-05-21 00:03:47] [INFO ] Invariant cache hit.
[2024-05-21 00:03:49] [INFO ] State equation strengthened by 6476 read => feed constraints.
[2024-05-21 00:04:19] [INFO ] Performed 654/1918 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 00:04:49] [INFO ] Performed 1693/1918 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-21 00:04:56] [INFO ] Implicit Places using invariants and state equation in 69279 ms returned []
Implicit Place search using SMT with State Equation took 71261 ms to find 0 implicit places.
[2024-05-21 00:04:57] [INFO ] Redundant transitions in 522 ms returned []
Running 6634 sub problems to find dead transitions.
[2024-05-21 00:04:57] [INFO ] Invariant cache hit.
[2024-05-21 00:04:57] [INFO ] State equation strengthened by 6476 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 1.0)
(s597 0.0)
(s598 1.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 1.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 1.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 1.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 1.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 1.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 1.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 1.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 1.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 1.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 1.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 0.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 0.0)
(s1740 0.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 0.0)
(s1745 0.0)
(s1746 0.0)
(s1747 0.0)
(s1748 0.0)
(s1749 0.0)
(s1750 0.0)
(s1751 0.0)
(s1752 0.0)
(s1753 0.0)
(s1754 0.0)
(s1755 0.0)
(s1756 0.0)
(s1757 0.0)
(s1758 0.0)
(s1759 0.0)
(s1760 0.0)
(s1761 0.0)
(s1762 0.0)
(s1763 0.0)
(s1764 0.0)
(s1765 0.0)
(s1766 0.0)
(s1767 0.0)
(s1768 0.0)
(s1769 0.0)
(s1770 0.0)
(s1771 0.0)
(s1772 0.0)
(s1773 0.0)
(s1774 0.0)
(s1775 0.0)
(s1776 0.0)
(s1777 0.0)
(s1778 0.0)
(s1779 0.0)
(s1780 0.0)
(s1781 0.0)
(s1782 0.0)
(s1783 0.0)
(s1784 0.0)
(s1785 0.0)
(s1786 0.0)
(s1787 0.0)
(s1788 0.0)
(s1789 0.0)
(s1790 0.0)
(s1791 0.0)
(s1792 0.0)
(s1793 0.0)
(s1794 0.0)
(s1795 0.0)
(s1796 0.0)
(s1797 0.0)
(s1798 0.0)
(s1799 0.0)
(s1800 0.0)
(s1801 0.0)
(s1802 0.0)
(s1803 1.0)
(s1804 0.0)
(s1805 0.0)
(s1806 0.0)
(s1807 0.0)
(s1808 0.0)
(s1809 0.0)
(s1810 0.0)
(s1811 0.0)
(s1812 0.0)
(s1813 0.0)
(s1814 0.0)
(s1815 0.0)
(s1816 0.0)
(s1817 0.0)
(s1818 0.0)
(s1819 0.0)
(s1820 0.0)
(s1821 0.0)
(s1822 0.0)
(s1823 0.0)
(s1824 0.0)
(s1825 0.0)
(s1826 0.0)
(s1827 0.0)
(s1828 0.0)
(s1829 0.0)
(s1830 0.0)
(s1831 0.0)
(s1832 0.0)
(s1833 0.0)
(s1834 0.0)
(s1835 0.0)
(s1836 0.0)
(s1837 0.0)
(s1838 0.0)
(s1839 0.0)
(s1840 0.0)
(s1841 0.0)
(s1842 0.0)
(s1843 0.0)
(s1844 0.0)
(s1845 0.0)
(s1846 0.0)
(s1847 0.0)
(s1848 0.0)
(s1849 0.0)
(s1850 0.0)
(s1851 0.0)
(s1852 0.0)
(s1853 0.0)
(s1854 0.0)
(s1855 0.0)
(s1856 0.0)
(s1857 0.0)
(s1858 0.0)
(s1859 0.0)
(s1860 0.0)
(s1861 0.0)
(s1862 0.0)
(s1863 0.0)
(s1864 0.0)
(s1865 0.0)
(s1866 0.0)
(s1867 0.0)
(s1868 0.0)
(s1869 0.0)
(s1870 0.0)
(s1871 0.0)
(s1872 0.0)
(s1873 0.0)
(s1874 0.0)
(s1875 0.0)
(s1876 0.0)
(s1877 0.0)
(s1878 0.0)
(s1879 1.0)
(s1880 0.0)
(s1881 0.0)
(s1882 0.0)
(s1883 0.0)
(s1884 1.0)
(s1885 0.0)
(s1886 0.0)
(s1887 0.0)
(s1888 0.0)
(s1889 0.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 1.0)
(s1894 0.0)
(s1895 1.0)
(s1896 1.0)
(s1897 1.0)
(s1898 1.0)
(s1899 1.0)
(s1900 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1917 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6634 unsolved
SMT process timed out in 36755ms, After SMT, problems are : Problem set: 0 solved, 6634 unsolved
Search for dead transitions found 0 dead transitions in 36826ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108780 ms. Remains : 1918/1918 places, 6674/6674 transitions.
[2024-05-21 00:05:34] [INFO ] Flatten gal took : 125 ms
RANDOM walk for 40000 steps (201 resets) in 705 ms. (56 steps per ms) remains 2/2 properties
[2024-05-21 00:05:34] [INFO ] Flatten gal took : 129 ms
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
[2024-05-21 00:05:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5940358679241936700.gal : 22 ms
[2024-05-21 00:05:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10099480919813245920.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5940358679241936700.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10099480919813245920.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10099480919813245920.prop.
Interrupted probabilistic random walk after 123863 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 2
Probabilistic random walk after 123863 steps, saw 34024 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-21 00:05:37] [INFO ] Invariant cache hit.
[2024-05-21 00:05:37] [INFO ] State equation strengthened by 6476 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1835/1836 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 00:05:37] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-21 00:05:38] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 0 ms to minimize.
[2024-05-21 00:05:38] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
[2024-05-21 00:05:38] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-21 00:05:38] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-21 00:05:38] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
[2024-05-21 00:05:38] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-21 00:05:38] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-21 00:05:38] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 0 ms to minimize.
[2024-05-21 00:05:38] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 0 ms to minimize.
[2024-05-21 00:05:38] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-21 00:05:38] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-05-21 00:05:38] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 0 ms to minimize.
[2024-05-21 00:05:38] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-21 00:05:39] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-21 00:05:39] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-21 00:05:39] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-21 00:05:39] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 0 ms to minimize.
[2024-05-21 00:05:39] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 0 ms to minimize.
[2024-05-21 00:05:39] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1836 variables, 20/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1836 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1914 variables, 39/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1914 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1916 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:05:41] [INFO ] Deduced a trap composed of 45 places in 1456 ms of which 11 ms to minimize.
[2024-05-21 00:05:42] [INFO ] Deduced a trap composed of 45 places in 1402 ms of which 11 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 37.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 0.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 0.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 0.0)
(s1740 0.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 0.0)
(s1745 0.0)
(s1746 0.0)
(s1747 0.0)
(s1748 0.0)
(s1749 0.0)
(s1750 0.0)
(s1751 0.0)
(s1752 0.0)
(s1753 0.0)
(s1754 0.0)
(s1755 0.0)
(s1756 0.0)
(s1757 0.0)
(s1758 0.0)
(s1759 0.0)
(s1760 0.0)
(s1761 0.0)
(s1762 0.0)
(s1763 0.0)
(s1764 0.0)
(s1765 0.0)
(s1766 0.0)
(s1767 0.0)
(s1768 0.0)
(s1769 0.0)
(s1770 0.0)
(s1771 0.0)
(s1772 0.0)
(s1773 0.0)
(s1774 0.0)
(s1775 0.0)
(s1776 0.0)
(s1777 0.0)
(s1778 0.0)
(s1779 0.0)
(s1780 0.0)
(s1781 0.0)
(s1782 0.0)
(s1783 0.0)
(s1784 0.0)
(s1785 0.0)
(s1786 0.0)
(s1787 0.0)
(s1788 0.0)
(s1789 0.0)
(s1790 0.0)
(s1791 0.0)
(s1792 0.0)
(s1793 0.0)
(s1794 0.0)
(s1795 0.0)
(s1796 0.0)
(s1797 0.0)
(s1798 0.0)
(s1799 0.0)
(s1800 0.0)
(s1801 0.0)
(s1802 0.0)
(s1803 0.0)
(s1804 0.0)
(s1805 0.0)
(s1806 0.0)
(s1807 0.0)
(s1808 0.0)
(s1809 0.0)
(s1810 0.0)
(s1811 0.0)
(s1812 0.0)
(s1813 0.0)
(s1814 0.0)
(s1815 0.0)
(s1816 0.0)
(s1817 0.0)
(s1818 0.0)
(s1819 0.0)
(s1820 0.0)
(s1821 0.0)
(s1822 0.0)
(s1823 0.0)
(s1824 0.0)
(s1825 0.0)
(s1826 0.0)
(s1827 0.0)
(s1828 0.0)
(s1829 0.0)
(s1830 0.0)
(s1831 0.0)
(s1832 0.0)
(s1833 0.0)
(s1834 0.0)
(s1835 0.0)
(s1836 0.0)
(s1837 0.0)
(s1838 0.0)
(s1839 0.0)
(s1840 0.0)
(s1841 0.0)
(s1842 0.0)
(s1843 0.0)
(s1844 0.0)
(s1845 0.0)
(s1846 0.0)
(s1847 0.0)
(s1848 0.0)
(s1849 0.0)
(s1850 0.0)
(s1851 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1916/8592 variables, and 64 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/1918 constraints, ReadFeed: 0/6476 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1835/1836 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1836 variables, 20/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:05:42] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-21 00:05:42] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-21 00:05:43] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-21 00:05:44] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 00:05:44] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-21 00:05:44] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1836 variables, 19/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1836 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 78/1914 variables, 39/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1914 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1916 variables, 2/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1916 variables, 2/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:05:45] [INFO ] Deduced a trap composed of 51 places in 1523 ms of which 11 ms to minimize.
[2024-05-21 00:05:47] [INFO ] Deduced a trap composed of 58 places in 1550 ms of which 15 ms to minimize.
[2024-05-21 00:05:49] [INFO ] Deduced a trap composed of 61 places in 1504 ms of which 11 ms to minimize.
SMT process timed out in 11452ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1918 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 151 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 1918/1918 places, 6674/6674 transitions.
RANDOM walk for 40000 steps (205 resets) in 596 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 131335 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 1
Probabilistic random walk after 131335 steps, saw 34954 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-21 00:05:52] [INFO ] Invariant cache hit.
[2024-05-21 00:05:52] [INFO ] State equation strengthened by 6476 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1835/1836 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:05:52] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1836 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1836 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1914 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1914 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1916 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:05:54] [INFO ] Deduced a trap composed of 71 places in 1547 ms of which 11 ms to minimize.
[2024-05-21 00:05:56] [INFO ] Deduced a trap composed of 46 places in 1508 ms of which 11 ms to minimize.
[2024-05-21 00:05:57] [INFO ] Deduced a trap composed of 48 places in 1513 ms of which 11 ms to minimize.
[2024-05-21 00:05:59] [INFO ] Deduced a trap composed of 50 places in 1447 ms of which 11 ms to minimize.
[2024-05-21 00:06:00] [INFO ] Deduced a trap composed of 52 places in 1388 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1696
[2024-05-21 00:06:01] [INFO ] Deduced a trap composed of 54 places in 1348 ms of which 11 ms to minimize.
[2024-05-21 00:06:03] [INFO ] Deduced a trap composed of 53 places in 1385 ms of which 11 ms to minimize.
[2024-05-21 00:06:04] [INFO ] Deduced a trap composed of 53 places in 1429 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1696 after 1820
[2024-05-21 00:06:06] [INFO ] Deduced a trap composed of 58 places in 1276 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1820 after 2026
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2026 after 2364
[2024-05-21 00:06:07] [INFO ] Deduced a trap composed of 55 places in 1289 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2364 after 2835
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2835 after 3198
[2024-05-21 00:06:08] [INFO ] Deduced a trap composed of 61 places in 1253 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3198 after 3250
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3250 after 3280
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3280 after 3360
[2024-05-21 00:06:09] [INFO ] Deduced a trap composed of 75 places in 1209 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3360 after 3565
[2024-05-21 00:06:11] [INFO ] Deduced a trap composed of 50 places in 1188 ms of which 10 ms to minimize.
[2024-05-21 00:06:12] [INFO ] Deduced a trap composed of 52 places in 1102 ms of which 10 ms to minimize.
[2024-05-21 00:06:13] [INFO ] Deduced a trap composed of 51 places in 1114 ms of which 10 ms to minimize.
[2024-05-21 00:06:14] [INFO ] Deduced a trap composed of 50 places in 1138 ms of which 9 ms to minimize.
[2024-05-21 00:06:15] [INFO ] Deduced a trap composed of 49 places in 1122 ms of which 9 ms to minimize.
[2024-05-21 00:06:16] [INFO ] Deduced a trap composed of 56 places in 1110 ms of which 10 ms to minimize.
[2024-05-21 00:06:18] [INFO ] Deduced a trap composed of 52 places in 1105 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3565 after 3847
[2024-05-21 00:06:19] [INFO ] Deduced a trap composed of 55 places in 1083 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1916 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:06:20] [INFO ] Deduced a trap composed of 53 places in 1080 ms of which 9 ms to minimize.
[2024-05-21 00:06:21] [INFO ] Deduced a trap composed of 58 places in 1081 ms of which 9 ms to minimize.
[2024-05-21 00:06:22] [INFO ] Deduced a trap composed of 53 places in 1032 ms of which 10 ms to minimize.
[2024-05-21 00:06:23] [INFO ] Deduced a trap composed of 51 places in 1005 ms of which 8 ms to minimize.
[2024-05-21 00:06:24] [INFO ] Deduced a trap composed of 90 places in 966 ms of which 8 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 00:06:24] [INFO ] Flatten gal took : 140 ms
[2024-05-21 00:06:24] [INFO ] Applying decomposition
[2024-05-21 00:06:24] [INFO ] Flatten gal took : 127 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/graph392715052590757930.txt' '-o' '/tmp/graph392715052590757930.bin' '-w' '/tmp/graph392715052590757930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph392715052590757930.bin' '-l' '-1' '-v' '-w' '/tmp/graph392715052590757930.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:06:25] [INFO ] Decomposing Gal with order
[2024-05-21 00:06:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:06:25] [INFO ] Deduced a trap composed of 81 places in 949 ms of which 8 ms to minimize.
[2024-05-21 00:06:25] [INFO ] Removed a total of 4989 redundant transitions.
[2024-05-21 00:06:25] [INFO ] Flatten gal took : 346 ms
[2024-05-21 00:06:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 5981 labels/synchronizations in 244 ms.
[2024-05-21 00:06:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6717861034931611372.gal : 41 ms
[2024-05-21 00:06:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12551825567497416801.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6717861034931611372.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12551825567497416801.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2024-05-21 00:06:26] [INFO ] Deduced a trap composed of 55 places in 868 ms of which 8 ms to minimize.
Loading property file /tmp/ReachabilityCardinality12551825567497416801.prop.
[2024-05-21 00:06:27] [INFO ] Deduced a trap composed of 54 places in 926 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :10 after 1586
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1586 after 1586
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1586 after 1586
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1586 after 1586
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1586 after 1586
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1586 after 1586
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1586 after 1586
[2024-05-21 00:06:28] [INFO ] Deduced a trap composed of 101 places in 1033 ms of which 9 ms to minimize.
[2024-05-21 00:06:29] [INFO ] Deduced a trap composed of 60 places in 912 ms of which 8 ms to minimize.
[2024-05-21 00:06:30] [INFO ] Deduced a trap composed of 59 places in 919 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1586 after 4201
[2024-05-21 00:06:31] [INFO ] Deduced a trap composed of 58 places in 924 ms of which 9 ms to minimize.
[2024-05-21 00:06:32] [INFO ] Deduced a trap composed of 56 places in 926 ms of which 9 ms to minimize.
[2024-05-21 00:06:33] [INFO ] Deduced a trap composed of 64 places in 903 ms of which 8 ms to minimize.
[2024-05-21 00:06:34] [INFO ] Deduced a trap composed of 68 places in 949 ms of which 8 ms to minimize.
[2024-05-21 00:06:35] [INFO ] Deduced a trap composed of 60 places in 902 ms of which 8 ms to minimize.
[2024-05-21 00:06:35] [INFO ] Deduced a trap composed of 94 places in 897 ms of which 8 ms to minimize.
[2024-05-21 00:06:36] [INFO ] Deduced a trap composed of 72 places in 913 ms of which 8 ms to minimize.
[2024-05-21 00:06:37] [INFO ] Deduced a trap composed of 66 places in 920 ms of which 8 ms to minimize.
SMT process timed out in 45474ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1918 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
Applied a total of 0 rules in 163 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 1918/1918 places, 6674/6674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 6674/6674 transitions.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4201 after 1.93966e+06
Applied a total of 0 rules in 156 ms. Remains 1918 /1918 variables (removed 0) and now considering 6674/6674 (removed 0) transitions.
[2024-05-21 00:06:38] [INFO ] Invariant cache hit.
[2024-05-21 00:06:40] [INFO ] Implicit Places using invariants in 1957 ms returned []
[2024-05-21 00:06:40] [INFO ] Invariant cache hit.
[2024-05-21 00:06:41] [INFO ] State equation strengthened by 6476 read => feed constraints.
[2024-05-21 00:07:12] [INFO ] Performed 675/1918 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2024-05-21 00:07:42] [INFO ] Performed 1916/1918 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-21 00:07:42] [INFO ] Implicit Places using invariants and state equation in 61980 ms returned []
Implicit Place search using SMT with State Equation took 63938 ms to find 0 implicit places.
[2024-05-21 00:07:42] [INFO ] Redundant transitions in 523 ms returned []
Running 6634 sub problems to find dead transitions.
[2024-05-21 00:07:42] [INFO ] Invariant cache hit.
[2024-05-21 00:07:42] [INFO ] State equation strengthened by 6476 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1917 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6634 unsolved
SMT process timed out in 36599ms, After SMT, problems are : Problem set: 0 solved, 6634 unsolved
Search for dead transitions found 0 dead transitions in 36654ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101290 ms. Remains : 1918/1918 places, 6674/6674 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[40]
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-05 in 304657 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[40]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[40]
// Phase 1: matrix 6679 rows 1923 cols
[2024-05-21 00:08:19] [INFO ] Computed 42 invariants in 166 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[40]
RANDOM walk for 10000 steps (50 resets) in 115 ms. (86 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-21 00:08:19] [INFO ] Invariant cache hit.
[2024-05-21 00:08:19] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-21 00:08:19] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-21 00:08:21] [INFO ] [Real]Absence check using state equation in 1230 ms returned sat
[2024-05-21 00:08:21] [INFO ] State equation strengthened by 6344 read => feed constraints.
[2024-05-21 00:08:21] [INFO ] [Real]Added 6344 Read/Feed constraints in 465 ms returned sat
[2024-05-21 00:08:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:08:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-21 00:08:22] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-21 00:08:23] [INFO ] [Nat]Absence check using state equation in 1252 ms returned sat
[2024-05-21 00:08:23] [INFO ] [Nat]Added 6344 Read/Feed constraints in 577 ms returned sat
[2024-05-21 00:08:24] [INFO ] Computed and/alt/rep : 4847/15511/4847 causal constraints (skipped 1792 transitions) in 334 ms.
[2024-05-21 00:08:25] [INFO ] Added : 7 causal constraints over 2 iterations in 1151 ms. Result :sat
Minimization took 1312 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1923/1923 places, 6679/6679 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1918 transition count 6674
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 1918 transition count 6673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 1917 transition count 6673
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 1917 transition count 6673
Applied a total of 19 rules in 579 ms. Remains 1917 /1923 variables (removed 6) and now considering 6673/6679 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 579 ms. Remains : 1917/1923 places, 6673/6679 transitions.
// Phase 1: matrix 6673 rows 1917 cols
[2024-05-21 00:08:27] [INFO ] Computed 42 invariants in 154 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[40]
RANDOM walk for 1000000 steps (5156 resets) in 10950 ms. (91 steps per ms)
BEST_FIRST walk for 1000001 steps (106 resets) in 1251 ms. (798 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[40]
[2024-05-21 00:08:39] [INFO ] Invariant cache hit.
[2024-05-21 00:08:39] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-21 00:08:39] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-21 00:08:40] [INFO ] [Real]Absence check using state equation in 1235 ms returned sat
[2024-05-21 00:08:41] [INFO ] State equation strengthened by 6477 read => feed constraints.
[2024-05-21 00:08:41] [INFO ] [Real]Added 6477 Read/Feed constraints in 475 ms returned sat
[2024-05-21 00:08:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:08:41] [INFO ] [Nat]Absence check using 40 positive place invariants in 30 ms returned sat
[2024-05-21 00:08:41] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:08:43] [INFO ] [Nat]Absence check using state equation in 1221 ms returned sat
[2024-05-21 00:08:43] [INFO ] [Nat]Added 6477 Read/Feed constraints in 492 ms returned sat
[2024-05-21 00:08:44] [INFO ] Computed and/alt/rep : 4804/15469/4804 causal constraints (skipped 1829 transitions) in 409 ms.
[2024-05-21 00:08:44] [INFO ] Added : 5 causal constraints over 1 iterations in 1030 ms. Result :sat
Minimization took 5143 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[40]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[40]
Support contains 1 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 161 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 1917/1917 places, 6673/6673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 155 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
[2024-05-21 00:08:50] [INFO ] Invariant cache hit.
[2024-05-21 00:08:52] [INFO ] Implicit Places using invariants in 1978 ms returned []
[2024-05-21 00:08:52] [INFO ] Invariant cache hit.
[2024-05-21 00:08:53] [INFO ] State equation strengthened by 6477 read => feed constraints.
[2024-05-21 00:09:24] [INFO ] Performed 684/1917 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 00:09:54] [INFO ] Performed 1725/1917 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-21 00:09:59] [INFO ] Implicit Places using invariants and state equation in 67364 ms returned []
Implicit Place search using SMT with State Equation took 69342 ms to find 0 implicit places.
[2024-05-21 00:10:00] [INFO ] Redundant transitions in 505 ms returned []
Running 6633 sub problems to find dead transitions.
[2024-05-21 00:10:00] [INFO ] Invariant cache hit.
[2024-05-21 00:10:00] [INFO ] State equation strengthened by 6477 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1916 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6633 unsolved
SMT process timed out in 36702ms, After SMT, problems are : Problem set: 0 solved, 6633 unsolved
Search for dead transitions found 0 dead transitions in 36755ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106771 ms. Remains : 1917/1917 places, 6673/6673 transitions.
[2024-05-21 00:10:37] [INFO ] Flatten gal took : 259 ms
RANDOM walk for 40000 steps (204 resets) in 1093 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
[2024-05-21 00:10:37] [INFO ] Flatten gal took : 156 ms
[2024-05-21 00:10:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16615207928492130041.gal : 22 ms
[2024-05-21 00:10:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14595892361225850455.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16615207928492130041.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14595892361225850455.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14595892361225850455.prop.
Interrupted probabilistic random walk after 122415 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 122415 steps, saw 33835 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-21 00:10:40] [INFO ] Invariant cache hit.
[2024-05-21 00:10:40] [INFO ] State equation strengthened by 6477 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1834/1835 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 00:10:40] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-21 00:10:40] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-21 00:10:40] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-21 00:10:40] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-21 00:10:40] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-21 00:10:40] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 00:10:41] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 20/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1913 variables, 39/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1913 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1915 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:10:43] [INFO ] Deduced a trap composed of 55 places in 1596 ms of which 12 ms to minimize.
[2024-05-21 00:10:45] [INFO ] Deduced a trap composed of 51 places in 1593 ms of which 12 ms to minimize.
SMT process timed out in 5210ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6673/6673 transitions.
Applied a total of 0 rules in 160 ms. Remains 1917 /1917 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 1917/1917 places, 6673/6673 transitions.
RANDOM walk for 40000 steps (205 resets) in 642 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 131835 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 1
Probabilistic random walk after 131835 steps, saw 35011 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-21 00:10:48] [INFO ] Invariant cache hit.
[2024-05-21 00:10:49] [INFO ] State equation strengthened by 6477 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1834/1835 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:10:49] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-21 00:10:49] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1913 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1913 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1915 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:10:51] [INFO ] Deduced a trap composed of 56 places in 1542 ms of which 11 ms to minimize.
[2024-05-21 00:10:52] [INFO ] Deduced a trap composed of 62 places in 1381 ms of which 12 ms to minimize.
[2024-05-21 00:10:53] [INFO ] Deduced a trap composed of 60 places in 1385 ms of which 11 ms to minimize.
[2024-05-21 00:10:55] [INFO ] Deduced a trap composed of 58 places in 1386 ms of which 11 ms to minimize.
[2024-05-21 00:10:56] [INFO ] Deduced a trap composed of 70 places in 1324 ms of which 10 ms to minimize.
[2024-05-21 00:10:58] [INFO ] Deduced a trap composed of 51 places in 1378 ms of which 10 ms to minimize.
[2024-05-21 00:10:59] [INFO ] Deduced a trap composed of 52 places in 1389 ms of which 11 ms to minimize.
[2024-05-21 00:11:00] [INFO ] Deduced a trap composed of 55 places in 1351 ms of which 10 ms to minimize.
[2024-05-21 00:11:02] [INFO ] Deduced a trap composed of 60 places in 1276 ms of which 11 ms to minimize.
[2024-05-21 00:11:03] [INFO ] Deduced a trap composed of 44 places in 1215 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1696
[2024-05-21 00:11:04] [INFO ] Deduced a trap composed of 58 places in 1132 ms of which 9 ms to minimize.
[2024-05-21 00:11:05] [INFO ] Deduced a trap composed of 100 places in 1180 ms of which 10 ms to minimize.
[2024-05-21 00:11:06] [INFO ] Deduced a trap composed of 57 places in 1061 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1696 after 1820
[2024-05-21 00:11:08] [INFO ] Deduced a trap composed of 45 places in 1039 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1820 after 2026
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2026 after 2364
[2024-05-21 00:11:09] [INFO ] Deduced a trap composed of 52 places in 1006 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2364 after 2835
SDD proceeding with computation,2 properties remain. new max is 128
[2024-05-21 00:11:10] [INFO ] Deduced a trap composed of 54 places in 997 ms of which 9 ms to minimize.
SDD size :2835 after 3181
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3181 after 3251
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3251 after 3281
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3281 after 3361
[2024-05-21 00:11:11] [INFO ] Deduced a trap composed of 59 places in 1000 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3361 after 3566
[2024-05-21 00:11:12] [INFO ] Deduced a trap composed of 60 places in 983 ms of which 8 ms to minimize.
[2024-05-21 00:11:13] [INFO ] Deduced a trap composed of 58 places in 923 ms of which 8 ms to minimize.
[2024-05-21 00:11:14] [INFO ] Deduced a trap composed of 58 places in 961 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1915 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:11:14] [INFO ] Deduced a trap composed of 58 places in 917 ms of which 7 ms to minimize.
[2024-05-21 00:11:15] [INFO ] Deduced a trap composed of 60 places in 923 ms of which 8 ms to minimize.
[2024-05-21 00:11:16] [INFO ] Deduced a trap composed of 55 places in 893 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3566 after 3848
[2024-05-21 00:11:17] [INFO ] Deduced a trap composed of 59 places in 866 ms of which 8 ms to minimize.
[2024-05-21 00:11:18] [INFO ] Deduced a trap composed of 62 places in 858 ms of which 8 ms to minimize.
[2024-05-21 00:11:19] [INFO ] Deduced a trap composed of 58 places in 857 ms of which 7 ms to minimize.
[2024-05-21 00:11:20] [INFO ] Deduced a trap composed of 59 places in 868 ms of which 7 ms to minimize.
[2024-05-21 00:11:21] [INFO ] Deduced a trap composed of 58 places in 875 ms of which 8 ms to minimize.
[2024-05-21 00:11:22] [INFO ] Deduced a trap composed of 57 places in 947 ms of which 7 ms to minimize.
[2024-05-21 00:11:23] [INFO ] Deduced a trap composed of 58 places in 871 ms of which 7 ms to minimize.
[2024-05-21 00:11:24] [INFO ] Deduced a trap composed of 58 places in 852 ms of which 8 ms to minimize.
[2024-05-21 00:11:24] [INFO ] Deduced a trap composed of 59 places in 841 ms of which 8 ms to minimize.
[2024-05-21 00:11:25] [INFO ] Deduced a trap composed of 58 places in 846 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3848 after 4346
[2024-05-21 00:11:26] [INFO ] Deduced a trap composed of 58 places in 831 ms of which 8 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 00:11:27] [INFO ] Deduced a trap composed of 60 places in 816 ms of which 7 ms to minimize.
[2024-05-21 00:11:27] [INFO ] Flatten gal took : 122 ms
[2024-05-21 00:11:27] [INFO ] Applying decomposition
[2024-05-21 00:11:27] [INFO ] Flatten gal took : 122 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/graph2042102120316264691.txt' '-o' '/tmp/graph2042102120316264691.bin' '-w' '/tmp/graph2042102120316264691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2042102120316264691.bin' '-l' '-1' '-v' '-w' '/tmp/graph2042102120316264691.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:11:27] [INFO ] Decomposing Gal with order
[2024-05-21 00:11:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:11:28] [INFO ] Deduced a trap composed of 56 places in 864 ms of which 7 ms to minimize.
[2024-05-21 00:11:28] [INFO ] Removed a total of 5066 redundant transitions.
[2024-05-21 00:11:28] [INFO ] Flatten gal took : 356 ms
[2024-05-21 00:11:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 6232 labels/synchronizations in 237 ms.
[2024-05-21 00:11:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9400628780290068161.gal : 40 ms
[2024-05-21 00:11:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5413439531382648903.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9400628780290068161.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5413439531382648903.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2024-05-21 00:11:29] [INFO ] Deduced a trap composed of 55 places in 793 ms of which 7 ms to minimize.
Loading property file /tmp/ReachabilityCardinality5413439531382648903.prop.
[2024-05-21 00:11:30] [INFO ] Deduced a trap composed of 55 places in 790 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 10
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :10 after 1623
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1623 after 1623
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1623 after 1623
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1623 after 1623
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1623 after 1623
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1623 after 1623
[2024-05-21 00:11:30] [INFO ] Deduced a trap composed of 54 places in 808 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1623 after 1623
[2024-05-21 00:11:31] [INFO ] Deduced a trap composed of 55 places in 837 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1915 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1915 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6673/8588 variables, 1915/1999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8588/8590 variables, and 8476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45020 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1915/1917 constraints, ReadFeed: 6477/6477 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1834/1835 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:11:34] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-21 00:11:34] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-05-21 00:11:34] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-21 00:11:34] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 0 ms to minimize.
[2024-05-21 00:11:34] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-05-21 00:11:34] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 0 ms to minimize.
[2024-05-21 00:11:34] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 0 ms to minimize.
[2024-05-21 00:11:34] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-21 00:11:34] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 0 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 0 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 0 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 0 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1835 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1835 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1913 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1913 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1915 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1915 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1623 after 863742
[2024-05-21 00:11:38] [INFO ] Deduced a trap composed of 45 places in 1476 ms of which 12 ms to minimize.
[2024-05-21 00:11:40] [INFO ] Deduced a trap composed of 46 places in 1517 ms of which 12 ms to minimize.
[2024-05-21 00:11:41] [INFO ] Deduced a trap composed of 51 places in 1582 ms of which 11 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :863742 after 1.67319e+06
[2024-05-21 00:11:43] [INFO ] Deduced a trap composed of 55 places in 1552 ms of which 12 ms to minimize.
[2024-05-21 00:11:44] [INFO ] Deduced a trap composed of 54 places in 1586 ms of which 11 ms to minimize.
[2024-05-21 00:11:46] [INFO ] Deduced a trap composed of 52 places in 1552 ms of which 12 ms to minimize.
[2024-05-21 00:11:48] [INFO ] Deduced a trap composed of 47 places in 1542 ms of which 11 ms to minimize.
[2024-05-21 00:11:49] [INFO ] Deduced a trap composed of 46 places in 1531 ms of which 11 ms to minimize.
[2024-05-21 00:11:51] [INFO ] Deduced a trap composed of 65 places in 1495 ms of which 12 ms to minimize.
[2024-05-21 00:11:52] [INFO ] Deduced a trap composed of 87 places in 1542 ms of which 11 ms to minimize.
[2024-05-21 00:11:54] [INFO ] Deduced a trap composed of 49 places in 1540 ms of which 11 ms to minimize.
[2024-05-21 00:11:56] [INFO ] Deduced a trap composed of 77 places in 1558 ms of which 12 ms to minimize.
[2024-05-21 00:11:57] [INFO ] Deduced a trap composed of 52 places in 1564 ms of which 11 ms to minimize.
[2024-05-21 00:11:59] [INFO ] Deduced a trap composed of 79 places in 1593 ms of which 11 ms to minimize.
[2024-05-21 00:12:00] [INFO ] Deduced a trap composed of 52 places in 1494 ms of which 12 ms to minimize.
[2024-05-21 00:12:02] [INFO ] Deduced a trap composed of 52 places in 1539 ms of which 11 ms to minimize.
[2024-05-21 00:12:03] [INFO ] Deduced a trap composed of 47 places in 1508 ms of which 12 ms to minimize.
[2024-05-21 00:12:05] [INFO ] Deduced a trap composed of 46 places in 1516 ms of which 11 ms to minimize.
[2024-05-21 00:12:07] [INFO ] Deduced a trap composed of 70 places in 1538 ms of which 11 ms to minimize.
[2024-05-21 00:12:08] [INFO ] Deduced a trap composed of 46 places in 1541 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1915 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved

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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="CANInsertWithFailure-PT-040"
export BK_EXAMINATION="UpperBounds"
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 CANInsertWithFailure-PT-040, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505200125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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