About the Execution of ITS-Tools for ShieldRVs-PT-050B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16204.712 | 3600000.00 | 3980164.00 | 9406.10 | ?T????T????????? | 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.r356-tall-171683762000857.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 ShieldRVs-PT-050B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762000857
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 17:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 625K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717064303214
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 10:18:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 10:18:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 10:18:24] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-05-30 10:18:24] [INFO ] Transformed 2003 places.
[2024-05-30 10:18:24] [INFO ] Transformed 2253 transitions.
[2024-05-30 10:18:24] [INFO ] Found NUPN structural information;
[2024-05-30 10:18:24] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 354 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA ShieldRVs-PT-050B-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 123 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 303 places :
Symmetric choice reduction at 0 with 303 rule applications. Total rules 303 place count 1700 transition count 1950
Iterating global reduction 0 with 303 rules applied. Total rules applied 606 place count 1700 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 607 place count 1699 transition count 1949
Iterating global reduction 0 with 1 rules applied. Total rules applied 608 place count 1699 transition count 1949
Applied a total of 608 rules in 399 ms. Remains 1699 /2003 variables (removed 304) and now considering 1949/2253 (removed 304) transitions.
// Phase 1: matrix 1949 rows 1699 cols
[2024-05-30 10:18:25] [INFO ] Computed 201 invariants in 40 ms
[2024-05-30 10:18:25] [INFO ] Implicit Places using invariants in 693 ms returned []
[2024-05-30 10:18:25] [INFO ] Invariant cache hit.
[2024-05-30 10:18:27] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned []
Implicit Place search using SMT with State Equation took 2142 ms to find 0 implicit places.
Running 1948 sub problems to find dead transitions.
[2024-05-30 10:18:27] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1698/3648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1948 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1699 constraints, PredecessorRefiner: 1948/1948 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1948 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1698/3648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1948 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1699 constraints, PredecessorRefiner: 0/1948 constraints, Known Traps: 0/0 constraints]
After SMT, in 60963ms problems are : Problem set: 0 solved, 1948 unsolved
Search for dead transitions found 0 dead transitions in 61002ms
Starting structural reductions in LTL mode, iteration 1 : 1699/2003 places, 1949/2253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63577 ms. Remains : 1699/2003 places, 1949/2253 transitions.
Support contains 123 out of 1699 places after structural reductions.
[2024-05-30 10:19:28] [INFO ] Flatten gal took : 292 ms
[2024-05-30 10:19:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVs-PT-050B-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 10:19:29] [INFO ] Flatten gal took : 131 ms
[2024-05-30 10:19:29] [INFO ] Input system was already deterministic with 1949 transitions.
Support contains 115 out of 1699 places (down from 123) after GAL structural reductions.
RANDOM walk for 40000 steps (16 resets) in 2608 ms. (15 steps per ms) remains 6/70 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
[2024-05-30 10:19:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1223/1236 variables, 143/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1236 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 463/1699 variables, 58/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1699 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1949/3648 variables, 1699/1900 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3648 variables, 0/1900 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/3648 variables, 0/1900 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3648/3648 variables, and 1900 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2260 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1699/1699 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1223/1236 variables, 143/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 10:19:33] [INFO ] Deduced a trap composed of 34 places in 358 ms of which 66 ms to minimize.
[2024-05-30 10:19:33] [INFO ] Deduced a trap composed of 45 places in 418 ms of which 23 ms to minimize.
[2024-05-30 10:19:34] [INFO ] Deduced a trap composed of 35 places in 396 ms of which 4 ms to minimize.
[2024-05-30 10:19:34] [INFO ] Deduced a trap composed of 40 places in 388 ms of which 4 ms to minimize.
[2024-05-30 10:19:35] [INFO ] Deduced a trap composed of 44 places in 387 ms of which 7 ms to minimize.
[2024-05-30 10:19:35] [INFO ] Deduced a trap composed of 49 places in 315 ms of which 4 ms to minimize.
[2024-05-30 10:19:35] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 20 ms to minimize.
[2024-05-30 10:19:36] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 4 ms to minimize.
[2024-05-30 10:19:36] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 3 ms to minimize.
[2024-05-30 10:19:36] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 3 ms to minimize.
[2024-05-30 10:19:36] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 4 ms to minimize.
[2024-05-30 10:19:36] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 4 ms to minimize.
[2024-05-30 10:19:37] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 3 ms to minimize.
[2024-05-30 10:19:37] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 3 ms to minimize.
[2024-05-30 10:19:37] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 3 ms to minimize.
[2024-05-30 10:19:37] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 3 ms to minimize.
[2024-05-30 10:19:37] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 3 ms to minimize.
[2024-05-30 10:19:38] [INFO ] Deduced a trap composed of 55 places in 196 ms of which 3 ms to minimize.
SMT process timed out in 7423ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 1699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1699 transition count 1750
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 1500 transition count 1749
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 1499 transition count 1749
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 247 Pre rules applied. Total rules applied 400 place count 1499 transition count 1502
Deduced a syphon composed of 247 places in 2 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 3 with 494 rules applied. Total rules applied 894 place count 1252 transition count 1502
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 935 place count 1211 transition count 1461
Iterating global reduction 3 with 41 rules applied. Total rules applied 976 place count 1211 transition count 1461
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 976 place count 1211 transition count 1447
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 1004 place count 1197 transition count 1447
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 482
Deduced a syphon composed of 482 places in 15 ms
Reduce places removed 482 places and 0 transitions.
Iterating global reduction 3 with 964 rules applied. Total rules applied 1968 place count 715 transition count 965
Partial Free-agglomeration rule applied 102 times.
Drop transitions (Partial Free agglomeration) removed 102 transitions
Iterating global reduction 3 with 102 rules applied. Total rules applied 2070 place count 715 transition count 965
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2071 place count 714 transition count 964
Applied a total of 2071 rules in 636 ms. Remains 714 /1699 variables (removed 985) and now considering 964/1949 (removed 985) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 714/1699 places, 964/1949 transitions.
RANDOM walk for 40000 steps (64 resets) in 588 ms. (67 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/2 properties
// Phase 1: matrix 964 rows 714 cols
[2024-05-30 10:19:39] [INFO ] Computed 201 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 477/503 variables, 136/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 686/1189 variables, 503/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1189 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 56/1245 variables, 21/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1245 variables, 5/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1245 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/1247 variables, 1/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1247 variables, 2/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1247 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 61/1308 variables, 22/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1308 variables, 4/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1308 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1314 variables, 3/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1314 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1314 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 63/1377 variables, 26/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1377 variables, 6/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1377 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/1381 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1381 variables, 4/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1381 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/1443 variables, 24/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1443 variables, 6/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1443 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/1447 variables, 2/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1447 variables, 4/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1447 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 62/1509 variables, 24/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1509 variables, 6/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1509 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/1513 variables, 2/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1513 variables, 4/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1513 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 63/1576 variables, 24/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1576 variables, 5/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1576 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 5/1581 variables, 3/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1581 variables, 5/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1581 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 62/1643 variables, 24/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1643 variables, 6/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1643 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/1647 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1647 variables, 4/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1647 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 29/1676 variables, 17/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1676 variables, 5/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1676 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 2/1678 variables, 2/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1678 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1678 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 0/1678 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1678/1678 variables, and 915 constraints, problems are : Problem set: 0 solved, 1 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 477/503 variables, 136/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:19:40] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 2 ms to minimize.
[2024-05-30 10:19:40] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:19:40] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:19:40] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:19:40] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-30 10:19:40] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-30 10:19:40] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-30 10:19:40] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:19:40] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:19:41] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:19:41] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:19:41] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:19:41] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:19:41] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-30 10:19:41] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 15/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 686/1189 variables, 503/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:19:41] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 5 ms to minimize.
[2024-05-30 10:19:41] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-05-30 10:19:41] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:19:42] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-30 10:19:42] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1189 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1189 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/1245 variables, 21/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1245 variables, 5/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1245 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:19:42] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:19:42] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:19:42] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:19:42] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:19:42] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 5 ms to minimize.
[2024-05-30 10:19:42] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 4 ms to minimize.
[2024-05-30 10:19:42] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:19:42] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:19:42] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:19:43] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:19:43] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:19:43] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-30 10:19:43] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-30 10:19:43] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-30 10:19:43] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:19:43] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-30 10:19:43] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:19:43] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 5 ms to minimize.
[2024-05-30 10:19:43] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-30 10:19:44] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1245 variables, 20/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:19:44] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:19:44] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:19:44] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-05-30 10:19:44] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:19:44] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:19:44] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 9 ms to minimize.
[2024-05-30 10:19:44] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:19:44] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 3 ms to minimize.
[2024-05-30 10:19:44] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 3 ms to minimize.
[2024-05-30 10:19:45] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:19:45] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-30 10:19:45] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:19:45] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:19:45] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2024-05-30 10:19:45] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:19:45] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-05-30 10:19:45] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:19:45] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:19:45] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-05-30 10:19:46] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1245 variables, 20/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:19:46] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:19:46] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2024-05-30 10:19:46] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
[2024-05-30 10:19:46] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-05-30 10:19:46] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:19:46] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:19:46] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:19:46] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:19:47] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2024-05-30 10:19:47] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:19:47] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-30 10:19:47] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:19:47] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:19:47] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:19:47] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:19:47] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:19:47] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1245 variables, 17/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1245 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1247 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1247 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1247 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 61/1308 variables, 22/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1308 variables, 4/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1308 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1314 variables, 3/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 4/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 63/1377 variables, 26/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1377 variables, 6/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:19:48] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1377 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1377 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/1381 variables, 2/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1381 variables, 4/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1381 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 62/1443 variables, 24/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1443 variables, 6/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1443 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 4/1447 variables, 2/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1447 variables, 4/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1447 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 62/1509 variables, 24/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1509 variables, 6/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1509 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 4/1513 variables, 2/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1513 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1513 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 63/1576 variables, 24/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1576 variables, 5/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1576 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 5/1581 variables, 3/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1581 variables, 5/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1581 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 62/1643 variables, 24/957 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1643 variables, 6/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1643 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 4/1647 variables, 2/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1647 variables, 4/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1647 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 29/1676 variables, 17/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1676 variables, 5/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1676 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 2/1678 variables, 2/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1678 variables, 1/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:19:48] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
At refinement iteration 61 (INCLUDED_ONLY) 0/1678 variables, 1/995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1678 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 0/1678 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1678/1678 variables, and 995 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8766 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 79/79 constraints]
After SMT, in 9610ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 372 ms.
Support contains 3 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 964/964 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 714 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 713 transition count 963
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 707 transition count 957
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 707 transition count 957
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 705 transition count 955
Applied a total of 18 rules in 289 ms. Remains 705 /714 variables (removed 9) and now considering 955/964 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 705/714 places, 955/964 transitions.
RANDOM walk for 40000 steps (67 resets) in 417 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 467926 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 467926 steps, saw 458341 distinct states, run finished after 3004 ms. (steps per millisecond=155 ) properties seen :0
// Phase 1: matrix 955 rows 705 cols
[2024-05-30 10:19:52] [INFO ] Computed 201 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/260 variables, 68/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 358/618 variables, 260/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/618 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 56/674 variables, 21/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 5/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/674 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/676 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/676 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 60/736 variables, 22/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/736 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/736 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/740 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/740 variables, 4/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/740 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/802 variables, 24/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/802 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/802 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/806 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/806 variables, 4/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/806 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/868 variables, 24/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/868 variables, 6/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/868 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/872 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/872 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/872 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 62/934 variables, 24/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/934 variables, 6/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/934 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/938 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/938 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/938 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 62/1000 variables, 24/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1000 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1000 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 4/1004 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1004 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1004 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 62/1066 variables, 24/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1066 variables, 6/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1066 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/1070 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1070 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1070 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 62/1132 variables, 24/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1132 variables, 6/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1132 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 4/1136 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1136 variables, 4/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1136 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 62/1198 variables, 24/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1198 variables, 6/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1198 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 4/1202 variables, 2/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1202 variables, 4/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1202 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 62/1264 variables, 24/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1264 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1264 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 4/1268 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1268 variables, 4/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1268 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 62/1330 variables, 24/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1330 variables, 6/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1330 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 4/1334 variables, 2/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1334 variables, 4/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 62/1396 variables, 24/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1396 variables, 6/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1396 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 4/1400 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1400 variables, 4/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1400 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 62/1462 variables, 24/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1462 variables, 6/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1462 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 4/1466 variables, 2/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1466 variables, 4/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1466 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 62/1528 variables, 24/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1528 variables, 6/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1528 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 4/1532 variables, 2/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1532 variables, 4/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1532 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 62/1594 variables, 24/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1594 variables, 6/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1594 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 4/1598 variables, 2/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1598 variables, 4/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1598 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 54/1652 variables, 24/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1652 variables, 6/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1652 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 4/1656 variables, 2/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1656 variables, 4/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1656 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 4/1660 variables, 4/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1660 variables, 2/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1660 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 0/1660 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1660/1660 variables, and 906 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 705/705 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/260 variables, 68/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:19:53] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:19:54] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2024-05-30 10:19:54] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:19:54] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:19:54] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:19:54] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 10:19:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 358/618 variables, 260/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:19:54] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:19:54] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:19:54] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:19:54] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:19:54] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:19:54] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:19:55] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:19:55] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:19:55] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:19:55] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:19:55] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:19:55] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:19:55] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 10:19:55] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 14/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/674 variables, 21/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 5/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/674 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:19:55] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-30 10:19:55] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-30 10:19:55] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:19:55] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:19:56] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:19:56] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:19:56] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-30 10:19:56] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:19:56] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:19:56] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-30 10:19:56] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:19:56] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:19:56] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-05-30 10:19:56] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:19:56] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:19:56] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:19:57] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:19:57] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:19:57] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:19:57] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/674 variables, 20/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:19:57] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:19:57] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:19:57] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-30 10:19:57] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 4 ms to minimize.
[2024-05-30 10:19:57] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:19:57] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:19:57] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:19:57] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:19:58] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:19:58] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:19:58] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:19:58] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:19:58] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:19:58] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-30 10:19:58] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:19:58] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:19:58] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-05-30 10:19:58] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:19:58] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:19:59] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/674 variables, 20/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:19:59] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:19:59] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:19:59] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:19:59] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:19:59] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:19:59] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:19:59] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:19:59] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:19:59] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-30 10:19:59] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:19:59] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:20:00] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:20:00] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:20:00] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-30 10:20:00] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-30 10:20:00] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:20:00] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:20:00] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:20:00] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:20:00] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/674 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:20:00] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-30 10:20:00] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:20:01] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:20:01] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:20:01] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:20:01] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:20:01] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:20:01] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:20:01] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:20:01] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:20:01] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:20:01] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:20:01] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:20:01] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:20:02] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:20:02] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:20:02] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:20:02] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:20:02] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:20:02] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/674 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:20:02] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:20:02] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-30 10:20:02] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:20:02] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:20:02] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 2 ms to minimize.
[2024-05-30 10:20:02] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:20:03] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:20:03] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:20:03] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-30 10:20:03] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:20:03] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:20:03] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:20:03] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:20:03] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:20:03] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:20:03] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:20:03] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:20:04] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
[2024-05-30 10:20:04] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:20:04] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/674 variables, 20/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:20:04] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:20:04] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-30 10:20:04] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:20:04] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:20:04] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:20:04] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:20:04] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:20:04] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:20:05] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:20:05] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:20:05] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 2 ms to minimize.
[2024-05-30 10:20:05] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:20:05] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:20:05] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 2 ms to minimize.
[2024-05-30 10:20:05] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:20:05] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:20:05] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:20:05] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:20:05] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:20:06] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/674 variables, 20/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:20:06] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:20:06] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:20:06] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:20:06] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:20:06] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 1 ms to minimize.
[2024-05-30 10:20:06] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:20:06] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:20:06] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2024-05-30 10:20:06] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:20:06] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:20:07] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 5 ms to minimize.
[2024-05-30 10:20:07] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:20:07] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:20:07] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:20:07] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-05-30 10:20:07] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
[2024-05-30 10:20:07] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:20:07] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 10 ms to minimize.
[2024-05-30 10:20:07] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:20:07] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/674 variables, 20/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:20:08] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:20:08] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:20:08] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:20:08] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:20:08] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:20:08] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:20:08] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2024-05-30 10:20:08] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:20:08] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:20:08] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:20:09] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:20:09] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2024-05-30 10:20:09] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2024-05-30 10:20:09] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:20:09] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:20:09] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:20:09] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:20:09] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:20:09] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:20:10] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/674 variables, 20/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:20:10] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:20:10] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:20:10] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:20:10] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:20:10] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:20:10] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:20:10] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-30 10:20:10] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:20:10] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:20:11] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:20:11] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:20:11] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:20:11] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:20:11] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 1 ms to minimize.
[2024-05-30 10:20:11] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:20:11] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:20:11] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:20:11] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:20:11] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:20:12] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/674 variables, 20/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:20:12] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:20:12] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:20:12] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2024-05-30 10:20:12] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:20:12] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:20:12] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:20:12] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:20:12] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2024-05-30 10:20:13] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:20:13] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:20:13] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:20:13] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:20:13] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:20:13] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:20:13] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:20:13] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:20:13] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:20:13] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-30 10:20:14] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:20:14] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/674 variables, 20/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:20:14] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:20:14] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:20:14] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:20:14] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:20:14] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:20:14] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:20:14] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:20:14] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-30 10:20:15] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:20:15] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:20:15] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-30 10:20:15] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:20:15] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:20:15] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:20:15] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:20:15] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:20:15] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:20:15] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:20:16] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:20:16] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/674 variables, 20/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:20:16] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:20:16] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:20:16] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:20:16] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:20:16] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:20:16] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:20:16] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:20:16] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:20:16] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:20:17] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:20:17] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:20:17] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:20:17] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:20:17] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:20:17] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/674 variables, 15/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/674 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/676 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/676 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/676 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 60/736 variables, 22/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/736 variables, 5/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:20:17] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/736 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/736 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 4/740 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/740 variables, 4/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/740 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 62/802 variables, 24/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/802 variables, 6/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:20:17] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/802 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/802 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 4/806 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/806 variables, 4/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/806 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 62/868 variables, 24/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/868 variables, 6/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:20:18] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/868 variables, 1/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/868 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/872 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/872 variables, 4/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/872 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 62/934 variables, 24/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/934 variables, 6/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/934 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 4/938 variables, 2/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/938 variables, 4/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/938 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 62/1000 variables, 24/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1000 variables, 6/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1000 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 4/1004 variables, 2/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1004 variables, 4/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1004 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 62/1066 variables, 24/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1066 variables, 6/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1066 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 4/1070 variables, 2/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1070 variables, 4/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1070 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 62/1132 variables, 24/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1132 variables, 6/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1132 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 4/1136 variables, 2/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1136 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1136 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 62/1198 variables, 24/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1198 variables, 6/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1198 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 4/1202 variables, 2/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1202 variables, 4/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1202 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 62/1264 variables, 24/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1264 variables, 6/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1264 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 4/1268 variables, 2/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1268 variables, 4/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1268 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 62/1330 variables, 24/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1330 variables, 6/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:20:18] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:20:18] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 10:20:18] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
At refinement iteration 87 (INCLUDED_ONLY) 0/1330 variables, 3/977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1330 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 4/1334 variables, 2/979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1334 variables, 4/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1334 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 62/1396 variables, 24/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1396 variables, 6/1013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1396 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 4/1400 variables, 2/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1400 variables, 4/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1400 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 62/1462 variables, 24/1043 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1462 variables, 6/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1462 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 4/1466 variables, 2/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1466 variables, 4/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1466 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 62/1528 variables, 24/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1528 variables, 6/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1528 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 4/1532 variables, 2/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1532 variables, 4/1091 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1532 variables, 0/1091 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 62/1594 variables, 24/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1594 variables, 6/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1594 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 4/1598 variables, 2/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1598 variables, 4/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1598 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 54/1652 variables, 24/1151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1652 variables, 6/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1652 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 4/1656 variables, 2/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1656 variables, 4/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1656 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 4/1660 variables, 4/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1660 variables, 2/1169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1660 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 0/1660 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1660/1660 variables, and 1169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25939 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 705/705 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 262/262 constraints]
After SMT, in 27102ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 274 ms.
Support contains 3 out of 705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 40 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 705/705 places, 955/955 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 46 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
[2024-05-30 10:20:20] [INFO ] Invariant cache hit.
[2024-05-30 10:20:21] [INFO ] Implicit Places using invariants in 1031 ms returned []
[2024-05-30 10:20:21] [INFO ] Invariant cache hit.
[2024-05-30 10:20:21] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1773 ms to find 0 implicit places.
[2024-05-30 10:20:22] [INFO ] Redundant transitions in 324 ms returned []
Running 952 sub problems to find dead transitions.
[2024-05-30 10:20:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:20:33] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:20:33] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:20:33] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:20:33] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-30 10:20:34] [INFO ] Deduced a trap composed of 22 places in 571 ms of which 1 ms to minimize.
[2024-05-30 10:20:34] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-30 10:20:34] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2024-05-30 10:20:34] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 1 ms to minimize.
[2024-05-30 10:20:35] [INFO ] Deduced a trap composed of 29 places in 390 ms of which 2 ms to minimize.
[2024-05-30 10:20:35] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 1 ms to minimize.
[2024-05-30 10:20:35] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 2 ms to minimize.
[2024-05-30 10:20:35] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:20:35] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-30 10:20:36] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:20:36] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2024-05-30 10:20:36] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-30 10:20:36] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-30 10:20:36] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2024-05-30 10:20:36] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2024-05-30 10:20:37] [INFO ] Deduced a trap composed of 34 places in 660 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:20:38] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-30 10:20:38] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:20:39] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2024-05-30 10:20:39] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:20:39] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:20:39] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:20:39] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:20:39] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:20:39] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:20:39] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:20:40] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:20:40] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 1 ms to minimize.
[2024-05-30 10:20:40] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:20:40] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:20:40] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:20:40] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:20:40] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:20:40] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:20:41] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2024-05-30 10:20:41] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:20:42] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:20:42] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:20:42] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-05-30 10:20:42] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:20:43] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:20:43] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:20:43] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:20:43] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2024-05-30 10:20:43] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2024-05-30 10:20:43] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 1 ms to minimize.
[2024-05-30 10:20:43] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-30 10:20:43] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
[2024-05-30 10:20:44] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:20:44] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:20:44] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:20:44] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 1 ms to minimize.
[2024-05-30 10:20:44] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 1 ms to minimize.
[2024-05-30 10:20:44] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 1 ms to minimize.
[2024-05-30 10:20:44] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:20:45] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1660 variables, and 187 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 127/201 constraints, State Equation: 0/705 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:20:54] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-30 10:20:54] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:20:54] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:20:54] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-30 10:20:54] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-30 10:20:55] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-30 10:20:55] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:20:55] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:20:55] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:20:55] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:20:55] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:20:55] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-05-30 10:20:56] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 1 ms to minimize.
[2024-05-30 10:20:56] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-05-30 10:20:56] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-05-30 10:20:56] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 1 ms to minimize.
[2024-05-30 10:20:56] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:20:56] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:20:56] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 1 ms to minimize.
[2024-05-30 10:20:56] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:20:58] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 4 ms to minimize.
[2024-05-30 10:20:58] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 3 ms to minimize.
[2024-05-30 10:20:59] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 4 ms to minimize.
[2024-05-30 10:20:59] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 3 ms to minimize.
[2024-05-30 10:20:59] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 4 ms to minimize.
[2024-05-30 10:21:00] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 4 ms to minimize.
[2024-05-30 10:21:00] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 3 ms to minimize.
[2024-05-30 10:21:00] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 4 ms to minimize.
[2024-05-30 10:21:00] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 3 ms to minimize.
[2024-05-30 10:21:01] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 3 ms to minimize.
[2024-05-30 10:21:01] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 4 ms to minimize.
[2024-05-30 10:21:01] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 4 ms to minimize.
[2024-05-30 10:21:01] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 4 ms to minimize.
[2024-05-30 10:21:01] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 3 ms to minimize.
[2024-05-30 10:21:02] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 4 ms to minimize.
[2024-05-30 10:21:02] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 3 ms to minimize.
[2024-05-30 10:21:02] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 4 ms to minimize.
[2024-05-30 10:21:02] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 3 ms to minimize.
[2024-05-30 10:21:03] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 3 ms to minimize.
[2024-05-30 10:21:03] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:21:05] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:21:05] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-05-30 10:21:05] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-30 10:21:05] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-30 10:21:05] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:21:05] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:21:05] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:21:06] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-30 10:21:06] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:21:06] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-05-30 10:21:06] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:21:06] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
[2024-05-30 10:21:06] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
[2024-05-30 10:21:06] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-30 10:21:06] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:21:07] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 1 ms to minimize.
[2024-05-30 10:21:07] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:21:07] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:21:07] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:21:07] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:21:09] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-30 10:21:09] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:21:09] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:21:09] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 1 ms to minimize.
[2024-05-30 10:21:09] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:21:09] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:21:09] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:21:10] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:21:10] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 9 ms to minimize.
[2024-05-30 10:21:10] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 1 ms to minimize.
[2024-05-30 10:21:10] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-30 10:21:10] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:21:10] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:21:10] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:21:10] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:21:10] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:21:11] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-30 10:21:11] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:21:11] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 1 ms to minimize.
[2024-05-30 10:21:11] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:21:13] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 1 ms to minimize.
[2024-05-30 10:21:13] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:21:13] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:21:13] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:21:13] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:21:13] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2024-05-30 10:21:13] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:21:13] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:21:13] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:21:14] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-30 10:21:14] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 1 ms to minimize.
[2024-05-30 10:21:14] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 1 ms to minimize.
[2024-05-30 10:21:14] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 14 ms to minimize.
[2024-05-30 10:21:14] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:21:14] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 1 ms to minimize.
[2024-05-30 10:21:14] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:21:14] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:21:14] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:21:14] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2024-05-30 10:21:15] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:21:16] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:21:16] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:21:16] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:21:17] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:21:17] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:21:17] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:21:17] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:21:17] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:21:17] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:21:17] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:21:17] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:21:17] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:21:17] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:21:17] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 0 ms to minimize.
[2024-05-30 10:21:18] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:21:18] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:21:18] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:21:18] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:21:18] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:21:18] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:21:20] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:21:20] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
[2024-05-30 10:21:20] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:21:20] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:21:20] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:21:20] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-05-30 10:21:20] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 1 ms to minimize.
[2024-05-30 10:21:20] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:21:21] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-05-30 10:21:21] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:21:21] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:21:21] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:21:21] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2024-05-30 10:21:21] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2024-05-30 10:21:21] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:21:21] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:21:21] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 1 ms to minimize.
[2024-05-30 10:21:21] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:21:22] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:21:22] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 20/327 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/1660 variables, and 327 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 127/201 constraints, State Equation: 0/705 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 200/200 constraints]
After SMT, in 60459ms problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60468ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62646 ms. Remains : 705/705 places, 955/955 transitions.
[2024-05-30 10:21:22] [INFO ] Flatten gal took : 143 ms
[2024-05-30 10:21:23] [INFO ] Flatten gal took : 153 ms
[2024-05-30 10:21:23] [INFO ] Input system was already deterministic with 1949 transitions.
Computed a total of 422 stabilizing places and 422 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1653 transition count 1903
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1653 transition count 1903
Applied a total of 92 rules in 151 ms. Remains 1653 /1699 variables (removed 46) and now considering 1903/1949 (removed 46) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2024-05-30 10:21:23] [INFO ] Computed 201 invariants in 9 ms
[2024-05-30 10:21:24] [INFO ] Implicit Places using invariants in 1117 ms returned []
[2024-05-30 10:21:24] [INFO ] Invariant cache hit.
[2024-05-30 10:21:26] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 2585 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 10:21:26] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60561ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60580ms
Starting structural reductions in LTL mode, iteration 1 : 1653/1699 places, 1903/1949 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63322 ms. Remains : 1653/1699 places, 1903/1949 transitions.
[2024-05-30 10:22:26] [INFO ] Flatten gal took : 53 ms
[2024-05-30 10:22:26] [INFO ] Flatten gal took : 58 ms
[2024-05-30 10:22:26] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 10:22:27] [INFO ] Flatten gal took : 51 ms
[2024-05-30 10:22:27] [INFO ] Flatten gal took : 63 ms
[2024-05-30 10:22:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality10587664592571157833.gal : 34 ms
[2024-05-30 10:22:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality17626829299518396220.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10587664592571157833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17626829299518396220.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:22:57] [INFO ] Flatten gal took : 54 ms
[2024-05-30 10:22:57] [INFO ] Applying decomposition
[2024-05-30 10:22:57] [INFO ] Flatten gal took : 60 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/graph10378783816825688816.txt' '-o' '/tmp/graph10378783816825688816.bin' '-w' '/tmp/graph10378783816825688816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10378783816825688816.bin' '-l' '-1' '-v' '-w' '/tmp/graph10378783816825688816.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:22:57] [INFO ] Decomposing Gal with order
[2024-05-30 10:22:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:22:58] [INFO ] Removed a total of 1791 redundant transitions.
[2024-05-30 10:22:58] [INFO ] Flatten gal took : 191 ms
[2024-05-30 10:22:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2024-05-30 10:22:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality2994463206282105523.gal : 28 ms
[2024-05-30 10:22:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality8899761868938075987.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2994463206282105523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8899761868938075987.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1658 transition count 1908
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1658 transition count 1908
Applied a total of 82 rules in 94 ms. Remains 1658 /1699 variables (removed 41) and now considering 1908/1949 (removed 41) transitions.
// Phase 1: matrix 1908 rows 1658 cols
[2024-05-30 10:23:28] [INFO ] Computed 201 invariants in 13 ms
[2024-05-30 10:23:28] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-30 10:23:28] [INFO ] Invariant cache hit.
[2024-05-30 10:23:30] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
Running 1907 sub problems to find dead transitions.
[2024-05-30 10:23:30] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1657/3566 variables, and 0 constraints, problems are : Problem set: 0 solved, 1907 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1658 constraints, PredecessorRefiner: 1907/1907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1657/3566 variables, and 0 constraints, problems are : Problem set: 0 solved, 1907 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1658 constraints, PredecessorRefiner: 0/1907 constraints, Known Traps: 0/0 constraints]
After SMT, in 60522ms problems are : Problem set: 0 solved, 1907 unsolved
Search for dead transitions found 0 dead transitions in 60539ms
Starting structural reductions in LTL mode, iteration 1 : 1658/1699 places, 1908/1949 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62670 ms. Remains : 1658/1699 places, 1908/1949 transitions.
[2024-05-30 10:24:31] [INFO ] Flatten gal took : 76 ms
[2024-05-30 10:24:31] [INFO ] Flatten gal took : 66 ms
[2024-05-30 10:24:31] [INFO ] Input system was already deterministic with 1908 transitions.
[2024-05-30 10:24:31] [INFO ] Flatten gal took : 44 ms
[2024-05-30 10:24:31] [INFO ] Flatten gal took : 45 ms
[2024-05-30 10:24:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality10923710813102875847.gal : 7 ms
[2024-05-30 10:24:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality4068930600130862651.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10923710813102875847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4068930600130862651.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:25:01] [INFO ] Flatten gal took : 45 ms
[2024-05-30 10:25:01] [INFO ] Applying decomposition
[2024-05-30 10:25:01] [INFO ] Flatten gal took : 45 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/graph10257106564625366394.txt' '-o' '/tmp/graph10257106564625366394.bin' '-w' '/tmp/graph10257106564625366394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10257106564625366394.bin' '-l' '-1' '-v' '-w' '/tmp/graph10257106564625366394.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:25:01] [INFO ] Decomposing Gal with order
[2024-05-30 10:25:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:25:02] [INFO ] Removed a total of 1791 redundant transitions.
[2024-05-30 10:25:02] [INFO ] Flatten gal took : 86 ms
[2024-05-30 10:25:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-30 10:25:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality14706867585158401335.gal : 17 ms
[2024-05-30 10:25:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality4020372304566529653.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14706867585158401335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4020372304566529653.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1698 transition count 1749
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 1499 transition count 1748
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 1498 transition count 1748
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 400 place count 1498 transition count 1498
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 900 place count 1248 transition count 1498
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 946 place count 1202 transition count 1452
Iterating global reduction 3 with 46 rules applied. Total rules applied 992 place count 1202 transition count 1452
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 992 place count 1202 transition count 1436
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1024 place count 1186 transition count 1436
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 474
Deduced a syphon composed of 474 places in 2 ms
Reduce places removed 474 places and 0 transitions.
Iterating global reduction 3 with 948 rules applied. Total rules applied 1972 place count 712 transition count 962
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1974 place count 710 transition count 960
Applied a total of 1974 rules in 276 ms. Remains 710 /1699 variables (removed 989) and now considering 960/1949 (removed 989) transitions.
// Phase 1: matrix 960 rows 710 cols
[2024-05-30 10:25:32] [INFO ] Computed 201 invariants in 7 ms
[2024-05-30 10:25:32] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-30 10:25:32] [INFO ] Invariant cache hit.
[2024-05-30 10:25:33] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
[2024-05-30 10:25:33] [INFO ] Redundant transitions in 174 ms returned [959]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 956 sub problems to find dead transitions.
// Phase 1: matrix 959 rows 710 cols
[2024-05-30 10:25:33] [INFO ] Computed 201 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-05-30 10:25:44] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:25:45] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-30 10:25:45] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-30 10:25:45] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-30 10:25:45] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:25:45] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 10:25:45] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-30 10:25:45] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-30 10:25:45] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:25:45] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:25:45] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:25:46] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-30 10:25:46] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-30 10:25:46] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:25:46] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-05-30 10:25:53] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-30 10:25:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-30 10:25:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-30 10:25:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-30 10:25:53] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-05-30 10:25:55] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:25:55] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-30 10:25:55] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:25:56] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:26:03] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-30 10:26:03] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-30 10:26:03] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-30 10:26:03] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-30 10:26:03] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-30 10:26:03] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 1.0)
(s531 0.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 1.0)
(s559 0.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 1.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 1.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 1.0)
(s629 0.0)
(s630 0.0)
(s631 1.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 1.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 1.0)
(s661 1.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 1.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 1.0)
(s671 0.0)
(s672 0.0)
(s673 1.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 0.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 1.0)
(s685 0.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 708/1669 variables, and 137 constraints, problems are : Problem set: 0 solved, 956 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 107/201 constraints, State Equation: 0/710 constraints, PredecessorRefiner: 956/956 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 956 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 30/137 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-05-30 10:26:06] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:26:06] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:26:06] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-30 10:26:06] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:26:06] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:26:06] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-30 10:26:06] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:26:07] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:26:07] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:26:07] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:26:07] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-30 10:26:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-30 10:26:15] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-30 10:26:15] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-30 10:26:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-30 10:26:15] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-30 10:26:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-30 10:26:15] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-30 10:26:16] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-30 10:26:16] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/708 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-05-30 10:26:18] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-30 10:26:21] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-30 10:26:21] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-30 10:26:21] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:26:27] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 10:26:27] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-30 10:26:27] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-30 10:26:27] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-30 10:26:27] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-30 10:26:28] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/708 variables, 10/167 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 708/1669 variables, and 167 constraints, problems are : Problem set: 0 solved, 956 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 107/201 constraints, State Equation: 0/710 constraints, PredecessorRefiner: 0/956 constraints, Known Traps: 60/60 constraints]
After SMT, in 60352ms problems are : Problem set: 0 solved, 956 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Starting structural reductions in SI_CTL mode, iteration 1 : 710/1699 places, 959/1949 transitions.
Applied a total of 0 rules in 69 ms. Remains 710 /710 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 61862 ms. Remains : 710/1699 places, 959/1949 transitions.
[2024-05-30 10:26:34] [INFO ] Flatten gal took : 26 ms
[2024-05-30 10:26:34] [INFO ] Flatten gal took : 27 ms
[2024-05-30 10:26:34] [INFO ] Input system was already deterministic with 959 transitions.
[2024-05-30 10:26:34] [INFO ] Flatten gal took : 27 ms
[2024-05-30 10:26:34] [INFO ] Flatten gal took : 27 ms
[2024-05-30 10:26:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality1840031441946363824.gal : 5 ms
[2024-05-30 10:26:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality13441851058257828294.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1840031441946363824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13441851058257828294.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:27:04] [INFO ] Flatten gal took : 27 ms
[2024-05-30 10:27:04] [INFO ] Applying decomposition
[2024-05-30 10:27:04] [INFO ] Flatten gal took : 27 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/graph12831979326371893137.txt' '-o' '/tmp/graph12831979326371893137.bin' '-w' '/tmp/graph12831979326371893137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12831979326371893137.bin' '-l' '-1' '-v' '-w' '/tmp/graph12831979326371893137.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:27:04] [INFO ] Decomposing Gal with order
[2024-05-30 10:27:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:27:04] [INFO ] Removed a total of 1051 redundant transitions.
[2024-05-30 10:27:04] [INFO ] Flatten gal took : 46 ms
[2024-05-30 10:27:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 862 labels/synchronizations in 24 ms.
[2024-05-30 10:27:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality2763475538669468314.gal : 6 ms
[2024-05-30 10:27:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality2035284232962546316.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2763475538669468314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2035284232962546316.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1698 transition count 1748
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 401 place count 1498 transition count 1747
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 402 place count 1497 transition count 1747
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 402 place count 1497 transition count 1499
Deduced a syphon composed of 248 places in 2 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 898 place count 1249 transition count 1499
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 944 place count 1203 transition count 1453
Iterating global reduction 3 with 46 rules applied. Total rules applied 990 place count 1203 transition count 1453
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 990 place count 1203 transition count 1437
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1022 place count 1187 transition count 1437
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 478
Deduced a syphon composed of 478 places in 2 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 3 with 956 rules applied. Total rules applied 1978 place count 709 transition count 959
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1980 place count 707 transition count 957
Applied a total of 1980 rules in 292 ms. Remains 707 /1699 variables (removed 992) and now considering 957/1949 (removed 992) transitions.
// Phase 1: matrix 957 rows 707 cols
[2024-05-30 10:27:34] [INFO ] Computed 201 invariants in 12 ms
[2024-05-30 10:27:35] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-30 10:27:35] [INFO ] Invariant cache hit.
[2024-05-30 10:27:35] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
[2024-05-30 10:27:36] [INFO ] Redundant transitions in 201 ms returned [956]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 953 sub problems to find dead transitions.
// Phase 1: matrix 956 rows 707 cols
[2024-05-30 10:27:36] [INFO ] Computed 201 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/705 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2024-05-30 10:27:47] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 12 ms to minimize.
[2024-05-30 10:27:47] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-05-30 10:27:47] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:27:48] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:27:48] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-30 10:27:48] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:27:48] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:27:48] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:27:48] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-30 10:27:48] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-30 10:27:49] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:27:49] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
[2024-05-30 10:27:49] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:27:49] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 14 ms to minimize.
[2024-05-30 10:27:49] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 2 ms to minimize.
[2024-05-30 10:27:49] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:27:49] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:27:50] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:27:50] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:27:50] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/705 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2024-05-30 10:27:52] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-30 10:27:52] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:27:52] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:27:52] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:27:52] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:27:52] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:27:53] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:27:53] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:27:53] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:27:53] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:27:53] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:27:53] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:27:53] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:27:53] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:27:54] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:27:54] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:27:54] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:27:54] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:27:54] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:27:54] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/705 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2024-05-30 10:27:56] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:27:56] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:27:56] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:27:57] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:27:57] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:27:57] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:27:57] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:27:57] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:27:57] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:27:57] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:27:57] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:27:58] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:27:58] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2024-05-30 10:27:58] [INFO ] Deduced a trap composed of 120 places in 118 ms of which 1 ms to minimize.
[2024-05-30 10:27:58] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:27:58] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:27:58] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:27:58] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:27:58] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:27:59] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/705 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 953 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 705/1663 variables, and 187 constraints, problems are : Problem set: 0 solved, 953 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 127/201 constraints, State Equation: 0/707 constraints, PredecessorRefiner: 953/953 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 953 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/705 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 953 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/705 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2024-05-30 10:28:08] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-05-30 10:28:09] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:28:09] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-30 10:28:09] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2024-05-30 10:28:09] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-05-30 10:28:09] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 2 ms to minimize.
[2024-05-30 10:28:09] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2024-05-30 10:28:09] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:28:10] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:28:10] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:28:10] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:28:10] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:28:10] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:28:10] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:28:10] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-05-30 10:28:10] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:28:11] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-05-30 10:28:11] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-05-30 10:28:11] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2024-05-30 10:28:11] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/705 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2024-05-30 10:28:13] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-05-30 10:28:13] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
[2024-05-30 10:28:13] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 1 ms to minimize.
[2024-05-30 10:28:13] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2024-05-30 10:28:14] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:28:14] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
[2024-05-30 10:28:14] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:28:14] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:28:14] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 1 ms to minimize.
[2024-05-30 10:28:14] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:28:14] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 0 ms to minimize.
[2024-05-30 10:28:14] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:28:15] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2024-05-30 10:28:15] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:28:15] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 1 ms to minimize.
[2024-05-30 10:28:15] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:28:15] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:28:15] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:28:15] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:28:16] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/705 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2024-05-30 10:28:18] [INFO ] Deduced a trap composed of 7 places in 263 ms of which 4 ms to minimize.
[2024-05-30 10:28:18] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 3 ms to minimize.
[2024-05-30 10:28:18] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 3 ms to minimize.
[2024-05-30 10:28:19] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 3 ms to minimize.
[2024-05-30 10:28:19] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2024-05-30 10:28:19] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 2 ms to minimize.
[2024-05-30 10:28:19] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2024-05-30 10:28:19] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2024-05-30 10:28:20] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-30 10:28:20] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
[2024-05-30 10:28:20] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
[2024-05-30 10:28:20] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-05-30 10:28:20] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:28:20] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2024-05-30 10:28:20] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:28:20] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:28:21] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:28:21] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:28:21] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-30 10:28:21] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2024-05-30 10:28:23] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2024-05-30 10:28:23] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:28:23] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 1 ms to minimize.
[2024-05-30 10:28:24] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:28:24] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-05-30 10:28:24] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:28:24] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:28:24] [INFO ] Deduced a trap composed of 116 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:28:24] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:28:24] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:28:25] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:28:25] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:28:25] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:28:25] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:28:25] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:28:25] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:28:25] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-05-30 10:28:26] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:28:26] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-05-30 10:28:26] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2024-05-30 10:28:28] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:28:28] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:28:28] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:28:28] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:28:28] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:28:28] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:28:29] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:28:29] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:28:29] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:28:29] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:28:29] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2024-05-30 10:28:29] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:28:30] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2024-05-30 10:28:30] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:28:30] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:28:30] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:28:30] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2024-05-30 10:28:30] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:28:30] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 1 ms to minimize.
[2024-05-30 10:28:31] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2024-05-30 10:28:32] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:28:32] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 10:28:33] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:28:33] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:28:33] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:28:33] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:28:33] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:28:33] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:28:33] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:28:33] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:28:35] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:28:35] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-05-30 10:28:35] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 2 ms to minimize.
[2024-05-30 10:28:35] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:28:36] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:28:36] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:28:36] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-30 10:28:36] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
SMT process timed out in 60346ms, After SMT, problems are : Problem set: 0 solved, 953 unsolved
Search for dead transitions found 0 dead transitions in 60353ms
Starting structural reductions in SI_CTL mode, iteration 1 : 707/1699 places, 956/1949 transitions.
Applied a total of 0 rules in 20 ms. Remains 707 /707 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 61827 ms. Remains : 707/1699 places, 956/1949 transitions.
[2024-05-30 10:28:36] [INFO ] Flatten gal took : 30 ms
[2024-05-30 10:28:36] [INFO ] Flatten gal took : 27 ms
[2024-05-30 10:28:36] [INFO ] Input system was already deterministic with 956 transitions.
[2024-05-30 10:28:36] [INFO ] Flatten gal took : 28 ms
[2024-05-30 10:28:36] [INFO ] Flatten gal took : 28 ms
[2024-05-30 10:28:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality15483720630089871868.gal : 7 ms
[2024-05-30 10:28:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality17632987050223466472.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15483720630089871868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17632987050223466472.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:29:06] [INFO ] Flatten gal took : 29 ms
[2024-05-30 10:29:06] [INFO ] Applying decomposition
[2024-05-30 10:29:06] [INFO ] Flatten gal took : 26 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/graph4218632109095476704.txt' '-o' '/tmp/graph4218632109095476704.bin' '-w' '/tmp/graph4218632109095476704.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4218632109095476704.bin' '-l' '-1' '-v' '-w' '/tmp/graph4218632109095476704.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:29:06] [INFO ] Decomposing Gal with order
[2024-05-30 10:29:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:29:06] [INFO ] Removed a total of 1048 redundant transitions.
[2024-05-30 10:29:07] [INFO ] Flatten gal took : 43 ms
[2024-05-30 10:29:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 856 labels/synchronizations in 22 ms.
[2024-05-30 10:29:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality10044743298704557204.gal : 4 ms
[2024-05-30 10:29:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality15395783811261336042.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10044743298704557204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15395783811261336042.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1698 transition count 1747
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1497 transition count 1747
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1497 transition count 1497
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1247 transition count 1497
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 949 place count 1200 transition count 1450
Iterating global reduction 2 with 47 rules applied. Total rules applied 996 place count 1200 transition count 1450
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 996 place count 1200 transition count 1433
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 1030 place count 1183 transition count 1433
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 477
Deduced a syphon composed of 477 places in 2 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 2 with 954 rules applied. Total rules applied 1984 place count 706 transition count 956
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1986 place count 704 transition count 954
Applied a total of 1986 rules in 211 ms. Remains 704 /1699 variables (removed 995) and now considering 954/1949 (removed 995) transitions.
// Phase 1: matrix 954 rows 704 cols
[2024-05-30 10:29:37] [INFO ] Computed 201 invariants in 2 ms
[2024-05-30 10:29:37] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-30 10:29:37] [INFO ] Invariant cache hit.
[2024-05-30 10:29:38] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
[2024-05-30 10:29:38] [INFO ] Redundant transitions in 189 ms returned [953]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 951 sub problems to find dead transitions.
// Phase 1: matrix 953 rows 704 cols
[2024-05-30 10:29:38] [INFO ] Computed 201 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 10:29:50] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:29:50] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:29:50] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 10:29:50] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:29:50] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-30 10:29:51] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 10:29:54] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-30 10:29:54] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-30 10:29:54] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-30 10:29:55] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-30 10:29:55] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-30 10:29:55] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:29:55] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-30 10:29:55] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-30 10:29:55] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:29:55] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:29:55] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-05-30 10:29:55] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-30 10:29:55] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-30 10:29:55] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-30 10:29:55] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-30 10:29:57] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 10:29:57] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-30 10:29:57] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:29:57] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-30 10:29:57] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 10:30:00] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 10:30:00] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:30:00] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2024-05-30 10:30:00] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-30 10:30:01] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-30 10:30:01] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2024-05-30 10:30:01] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2024-05-30 10:30:01] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-30 10:30:01] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-30 10:30:01] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-30 10:30:01] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:30:01] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:30:01] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:30:01] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-30 10:30:03] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 10:30:08] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 10:30:08] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-30 10:30:08] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1657 variables, and 82 constraints, problems are : Problem set: 0 solved, 951 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 24/201 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 951/951 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 951 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 58/82 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 10:30:12] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:30:12] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-30 10:30:12] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:30:12] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:30:12] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 10:30:12] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 10:30:13] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 10:30:13] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-30 10:30:13] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:30:13] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:30:13] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:30:13] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-05-30 10:30:13] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:30:13] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-30 10:30:13] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-30 10:30:13] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:30:15] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 17/99 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 10:30:23] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:30:23] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:30:23] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:30:23] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-30 10:30:23] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-30 10:30:23] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:30:23] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:30:23] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:30:23] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:30:24] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 4 ms to minimize.
[2024-05-30 10:30:24] [INFO ] Deduced a trap composed of 10 places in 310 ms of which 4 ms to minimize.
[2024-05-30 10:30:24] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 4 ms to minimize.
[2024-05-30 10:30:25] [INFO ] Deduced a trap composed of 12 places in 321 ms of which 5 ms to minimize.
[2024-05-30 10:30:25] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 4 ms to minimize.
[2024-05-30 10:30:25] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 18 ms to minimize.
[2024-05-30 10:30:26] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 4 ms to minimize.
[2024-05-30 10:30:26] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 3 ms to minimize.
[2024-05-30 10:30:26] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 4 ms to minimize.
[2024-05-30 10:30:27] [INFO ] Deduced a trap composed of 7 places in 320 ms of which 4 ms to minimize.
[2024-05-30 10:30:27] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 10:30:30] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:30:30] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2024-05-30 10:30:30] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:30:30] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:30:31] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:30:31] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-05-30 10:30:31] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-30 10:30:31] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:30:31] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:30:31] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-05-30 10:30:31] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:30:31] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:30:31] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:30:33] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:30:33] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 10:30:33] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-30 10:30:33] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2024-05-30 10:30:33] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-30 10:30:33] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-30 10:30:33] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 10:30:36] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 10:30:36] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-30 10:30:36] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-30 10:30:36] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-05-30 10:30:37] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-05-30 10:30:37] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-30 10:30:37] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-30 10:30:37] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:30:37] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2024-05-30 10:30:37] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2024-05-30 10:30:37] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:30:37] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:30:37] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-05-30 10:30:37] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-30 10:30:37] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2024-05-30 10:30:37] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:30:37] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/1657 variables, and 156 constraints, problems are : Problem set: 0 solved, 951 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 24/201 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 0/951 constraints, Known Traps: 132/132 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 60351ms
Starting structural reductions in SI_CTL mode, iteration 1 : 704/1699 places, 953/1949 transitions.
Applied a total of 0 rules in 18 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 61730 ms. Remains : 704/1699 places, 953/1949 transitions.
[2024-05-30 10:30:38] [INFO ] Flatten gal took : 30 ms
[2024-05-30 10:30:38] [INFO ] Flatten gal took : 31 ms
[2024-05-30 10:30:38] [INFO ] Input system was already deterministic with 953 transitions.
[2024-05-30 10:30:39] [INFO ] Flatten gal took : 47 ms
[2024-05-30 10:30:39] [INFO ] Flatten gal took : 63 ms
[2024-05-30 10:30:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality7618095979012438496.gal : 5 ms
[2024-05-30 10:30:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality13970384563364796043.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7618095979012438496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13970384563364796043.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:31:09] [INFO ] Flatten gal took : 33 ms
[2024-05-30 10:31:09] [INFO ] Applying decomposition
[2024-05-30 10:31:09] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15532211914957899651.txt' '-o' '/tmp/graph15532211914957899651.bin' '-w' '/tmp/graph15532211914957899651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15532211914957899651.bin' '-l' '-1' '-v' '-w' '/tmp/graph15532211914957899651.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:31:09] [INFO ] Decomposing Gal with order
[2024-05-30 10:31:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:31:09] [INFO ] Removed a total of 1045 redundant transitions.
[2024-05-30 10:31:09] [INFO ] Flatten gal took : 60 ms
[2024-05-30 10:31:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 1036 labels/synchronizations in 42 ms.
[2024-05-30 10:31:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality17861950391374426933.gal : 8 ms
[2024-05-30 10:31:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality7851160493830265326.ctl : 46 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17861950391374426933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7851160493830265326.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1654 transition count 1904
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1654 transition count 1904
Applied a total of 90 rules in 105 ms. Remains 1654 /1699 variables (removed 45) and now considering 1904/1949 (removed 45) transitions.
// Phase 1: matrix 1904 rows 1654 cols
[2024-05-30 10:31:39] [INFO ] Computed 201 invariants in 15 ms
[2024-05-30 10:31:40] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-30 10:31:40] [INFO ] Invariant cache hit.
[2024-05-30 10:31:41] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 2054 ms to find 0 implicit places.
Running 1903 sub problems to find dead transitions.
[2024-05-30 10:31:41] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1653/3558 variables, and 0 constraints, problems are : Problem set: 0 solved, 1903 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1654 constraints, PredecessorRefiner: 1903/1903 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1903 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1653/3558 variables, and 0 constraints, problems are : Problem set: 0 solved, 1903 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1654 constraints, PredecessorRefiner: 0/1903 constraints, Known Traps: 0/0 constraints]
After SMT, in 60616ms problems are : Problem set: 0 solved, 1903 unsolved
Search for dead transitions found 0 dead transitions in 60635ms
Starting structural reductions in LTL mode, iteration 1 : 1654/1699 places, 1904/1949 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62799 ms. Remains : 1654/1699 places, 1904/1949 transitions.
[2024-05-30 10:32:42] [INFO ] Flatten gal took : 42 ms
[2024-05-30 10:32:42] [INFO ] Flatten gal took : 44 ms
[2024-05-30 10:32:42] [INFO ] Input system was already deterministic with 1904 transitions.
[2024-05-30 10:32:42] [INFO ] Flatten gal took : 43 ms
[2024-05-30 10:32:42] [INFO ] Flatten gal took : 43 ms
[2024-05-30 10:32:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality11731023880858011786.gal : 8 ms
[2024-05-30 10:32:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality11888546787791467287.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11731023880858011786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11888546787791467287.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:33:12] [INFO ] Flatten gal took : 46 ms
[2024-05-30 10:33:12] [INFO ] Applying decomposition
[2024-05-30 10:33:12] [INFO ] Flatten gal took : 45 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/graph5311703750038837542.txt' '-o' '/tmp/graph5311703750038837542.bin' '-w' '/tmp/graph5311703750038837542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5311703750038837542.bin' '-l' '-1' '-v' '-w' '/tmp/graph5311703750038837542.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:33:13] [INFO ] Decomposing Gal with order
[2024-05-30 10:33:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:33:13] [INFO ] Removed a total of 1791 redundant transitions.
[2024-05-30 10:33:13] [INFO ] Flatten gal took : 73 ms
[2024-05-30 10:33:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 10:33:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality5957122733822796063.gal : 12 ms
[2024-05-30 10:33:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality17735291129330065271.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5957122733822796063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17735291129330065271.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 1655 transition count 1905
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 1655 transition count 1905
Applied a total of 88 rules in 127 ms. Remains 1655 /1699 variables (removed 44) and now considering 1905/1949 (removed 44) transitions.
// Phase 1: matrix 1905 rows 1655 cols
[2024-05-30 10:33:43] [INFO ] Computed 201 invariants in 12 ms
[2024-05-30 10:33:43] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-30 10:33:43] [INFO ] Invariant cache hit.
[2024-05-30 10:33:45] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
Running 1904 sub problems to find dead transitions.
[2024-05-30 10:33:45] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1654/3560 variables, and 0 constraints, problems are : Problem set: 0 solved, 1904 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1655 constraints, PredecessorRefiner: 1904/1904 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1904 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1654/3560 variables, and 0 constraints, problems are : Problem set: 0 solved, 1904 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1655 constraints, PredecessorRefiner: 0/1904 constraints, Known Traps: 0/0 constraints]
After SMT, in 60583ms problems are : Problem set: 0 solved, 1904 unsolved
Search for dead transitions found 0 dead transitions in 60600ms
Starting structural reductions in LTL mode, iteration 1 : 1655/1699 places, 1905/1949 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62589 ms. Remains : 1655/1699 places, 1905/1949 transitions.
[2024-05-30 10:34:46] [INFO ] Flatten gal took : 42 ms
[2024-05-30 10:34:46] [INFO ] Flatten gal took : 44 ms
[2024-05-30 10:34:46] [INFO ] Input system was already deterministic with 1905 transitions.
[2024-05-30 10:34:46] [INFO ] Flatten gal took : 45 ms
[2024-05-30 10:34:46] [INFO ] Flatten gal took : 43 ms
[2024-05-30 10:34:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality9559377395170780963.gal : 7 ms
[2024-05-30 10:34:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality13754208628664946129.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9559377395170780963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13754208628664946129.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:35:16] [INFO ] Flatten gal took : 44 ms
[2024-05-30 10:35:16] [INFO ] Applying decomposition
[2024-05-30 10:35:16] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3692142305798976260.txt' '-o' '/tmp/graph3692142305798976260.bin' '-w' '/tmp/graph3692142305798976260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3692142305798976260.bin' '-l' '-1' '-v' '-w' '/tmp/graph3692142305798976260.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:35:16] [INFO ] Decomposing Gal with order
[2024-05-30 10:35:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:35:16] [INFO ] Removed a total of 1791 redundant transitions.
[2024-05-30 10:35:16] [INFO ] Flatten gal took : 72 ms
[2024-05-30 10:35:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-30 10:35:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality8986481315560955755.gal : 15 ms
[2024-05-30 10:35:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality5471706843956598635.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8986481315560955755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5471706843956598635.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1654 transition count 1904
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1654 transition count 1904
Applied a total of 90 rules in 113 ms. Remains 1654 /1699 variables (removed 45) and now considering 1904/1949 (removed 45) transitions.
// Phase 1: matrix 1904 rows 1654 cols
[2024-05-30 10:35:47] [INFO ] Computed 201 invariants in 7 ms
[2024-05-30 10:35:47] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-30 10:35:47] [INFO ] Invariant cache hit.
[2024-05-30 10:35:48] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
Running 1903 sub problems to find dead transitions.
[2024-05-30 10:35:48] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1653/3558 variables, and 0 constraints, problems are : Problem set: 0 solved, 1903 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1654 constraints, PredecessorRefiner: 1903/1903 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1903 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1653/3558 variables, and 0 constraints, problems are : Problem set: 0 solved, 1903 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1654 constraints, PredecessorRefiner: 0/1903 constraints, Known Traps: 0/0 constraints]
After SMT, in 60579ms problems are : Problem set: 0 solved, 1903 unsolved
Search for dead transitions found 0 dead transitions in 60596ms
Starting structural reductions in LTL mode, iteration 1 : 1654/1699 places, 1904/1949 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62668 ms. Remains : 1654/1699 places, 1904/1949 transitions.
[2024-05-30 10:36:49] [INFO ] Flatten gal took : 40 ms
[2024-05-30 10:36:49] [INFO ] Flatten gal took : 42 ms
[2024-05-30 10:36:49] [INFO ] Input system was already deterministic with 1904 transitions.
[2024-05-30 10:36:49] [INFO ] Flatten gal took : 42 ms
[2024-05-30 10:36:49] [INFO ] Flatten gal took : 42 ms
[2024-05-30 10:36:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality15722536634469051730.gal : 7 ms
[2024-05-30 10:36:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality1725221594891661347.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15722536634469051730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1725221594891661347.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:37:19] [INFO ] Flatten gal took : 41 ms
[2024-05-30 10:37:19] [INFO ] Applying decomposition
[2024-05-30 10:37:19] [INFO ] Flatten gal took : 42 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/graph5997681252966842230.txt' '-o' '/tmp/graph5997681252966842230.bin' '-w' '/tmp/graph5997681252966842230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5997681252966842230.bin' '-l' '-1' '-v' '-w' '/tmp/graph5997681252966842230.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:37:20] [INFO ] Decomposing Gal with order
[2024-05-30 10:37:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:37:20] [INFO ] Removed a total of 1791 redundant transitions.
[2024-05-30 10:37:20] [INFO ] Flatten gal took : 68 ms
[2024-05-30 10:37:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-30 10:37:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality14458977187872717430.gal : 27 ms
[2024-05-30 10:37:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality12323611410847416140.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14458977187872717430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12323611410847416140.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1699 transition count 1751
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 397 place count 1501 transition count 1750
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 1500 transition count 1750
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 398 place count 1500 transition count 1502
Deduced a syphon composed of 248 places in 2 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 894 place count 1252 transition count 1502
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 937 place count 1209 transition count 1459
Iterating global reduction 3 with 43 rules applied. Total rules applied 980 place count 1209 transition count 1459
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 980 place count 1209 transition count 1444
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1010 place count 1194 transition count 1444
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 479
Deduced a syphon composed of 479 places in 1 ms
Reduce places removed 479 places and 0 transitions.
Iterating global reduction 3 with 958 rules applied. Total rules applied 1968 place count 715 transition count 965
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 1968 rules in 253 ms. Remains 715 /1699 variables (removed 984) and now considering 965/1949 (removed 984) transitions.
// Phase 1: matrix 965 rows 715 cols
[2024-05-30 10:37:50] [INFO ] Computed 201 invariants in 2 ms
[2024-05-30 10:37:50] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-30 10:37:51] [INFO ] Invariant cache hit.
[2024-05-30 10:37:51] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2024-05-30 10:37:51] [INFO ] Redundant transitions in 148 ms returned [964]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 963 sub problems to find dead transitions.
// Phase 1: matrix 964 rows 715 cols
[2024-05-30 10:37:51] [INFO ] Computed 201 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/714 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 1 (OVERLAPS) 1/715 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-30 10:38:10] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 2 ms to minimize.
[2024-05-30 10:38:10] [INFO ] Deduced a trap composed of 156 places in 143 ms of which 2 ms to minimize.
[2024-05-30 10:38:10] [INFO ] Deduced a trap composed of 133 places in 133 ms of which 1 ms to minimize.
[2024-05-30 10:38:10] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:38:10] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:38:10] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 2 ms to minimize.
[2024-05-30 10:38:11] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 2 ms to minimize.
[2024-05-30 10:38:11] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 2 ms to minimize.
[2024-05-30 10:38:11] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2024-05-30 10:38:11] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 2 ms to minimize.
[2024-05-30 10:38:11] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:38:11] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 2 ms to minimize.
[2024-05-30 10:38:12] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 2 ms to minimize.
[2024-05-30 10:38:12] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 2 ms to minimize.
[2024-05-30 10:38:12] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 2 ms to minimize.
[2024-05-30 10:38:12] [INFO ] Deduced a trap composed of 143 places in 159 ms of which 2 ms to minimize.
[2024-05-30 10:38:12] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 2 ms to minimize.
[2024-05-30 10:38:12] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 2 ms to minimize.
[2024-05-30 10:38:13] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 2 ms to minimize.
[2024-05-30 10:38:13] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/715 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-30 10:38:13] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 2 ms to minimize.
[2024-05-30 10:38:14] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:38:14] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 2 ms to minimize.
[2024-05-30 10:38:14] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 2 ms to minimize.
[2024-05-30 10:38:14] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 2 ms to minimize.
[2024-05-30 10:38:14] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-05-30 10:38:14] [INFO ] Deduced a trap composed of 126 places in 151 ms of which 2 ms to minimize.
[2024-05-30 10:38:15] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2024-05-30 10:38:15] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:38:15] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
[2024-05-30 10:38:15] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 2 ms to minimize.
[2024-05-30 10:38:15] [INFO ] Deduced a trap composed of 112 places in 147 ms of which 2 ms to minimize.
[2024-05-30 10:38:15] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 2 ms to minimize.
[2024-05-30 10:38:15] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-30 10:38:16] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-30 10:38:16] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-30 10:38:16] [INFO ] Deduced a trap composed of 111 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:38:16] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:38:16] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 10:38:16] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/715 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 963 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 715/1679 variables, and 241 constraints, problems are : Problem set: 0 solved, 963 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/715 constraints, PredecessorRefiner: 963/963 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 963 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/714 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 1 (OVERLAPS) 1/715 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/715 variables, 40/241 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-30 10:38:31] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-05-30 10:38:32] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-05-30 10:38:32] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-05-30 10:38:32] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2024-05-30 10:38:32] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 2 ms to minimize.
[2024-05-30 10:38:33] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 2 ms to minimize.
[2024-05-30 10:38:33] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 2 ms to minimize.
[2024-05-30 10:38:33] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2024-05-30 10:38:33] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 2 ms to minimize.
[2024-05-30 10:38:33] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 2 ms to minimize.
[2024-05-30 10:38:33] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 2 ms to minimize.
[2024-05-30 10:38:34] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:38:34] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:38:34] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 2 ms to minimize.
[2024-05-30 10:38:34] [INFO ] Deduced a trap composed of 136 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:38:34] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-05-30 10:38:34] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-05-30 10:38:35] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:38:35] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 3 ms to minimize.
[2024-05-30 10:38:35] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/715 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-30 10:38:36] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 2 ms to minimize.
[2024-05-30 10:38:36] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 2 ms to minimize.
[2024-05-30 10:38:36] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 2 ms to minimize.
[2024-05-30 10:38:36] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
[2024-05-30 10:38:36] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 2 ms to minimize.
[2024-05-30 10:38:37] [INFO ] Deduced a trap composed of 121 places in 136 ms of which 2 ms to minimize.
[2024-05-30 10:38:37] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-05-30 10:38:37] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 2 ms to minimize.
[2024-05-30 10:38:37] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 2 ms to minimize.
[2024-05-30 10:38:37] [INFO ] Deduced a trap composed of 101 places in 150 ms of which 2 ms to minimize.
[2024-05-30 10:38:37] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 2 ms to minimize.
[2024-05-30 10:38:38] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 2 ms to minimize.
[2024-05-30 10:38:38] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2024-05-30 10:38:38] [INFO ] Deduced a trap composed of 112 places in 134 ms of which 2 ms to minimize.
[2024-05-30 10:38:38] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:38:38] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:38:38] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2024-05-30 10:38:39] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2024-05-30 10:38:39] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 2 ms to minimize.
[2024-05-30 10:38:39] [INFO ] Deduced a trap composed of 135 places in 132 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/715 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-30 10:38:40] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2024-05-30 10:38:40] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 3 ms to minimize.
[2024-05-30 10:38:40] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 3 ms to minimize.
[2024-05-30 10:38:40] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 3 ms to minimize.
[2024-05-30 10:38:40] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 2 ms to minimize.
[2024-05-30 10:38:41] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 2 ms to minimize.
[2024-05-30 10:38:41] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 2 ms to minimize.
[2024-05-30 10:38:41] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 2 ms to minimize.
[2024-05-30 10:38:41] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-05-30 10:38:41] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 3 ms to minimize.
[2024-05-30 10:38:42] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 2 ms to minimize.
[2024-05-30 10:38:42] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:38:42] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 3 ms to minimize.
[2024-05-30 10:38:42] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 2 ms to minimize.
[2024-05-30 10:38:42] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 2 ms to minimize.
[2024-05-30 10:38:42] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 2 ms to minimize.
[2024-05-30 10:38:43] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 2 ms to minimize.
[2024-05-30 10:38:43] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 2 ms to minimize.
[2024-05-30 10:38:43] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
[2024-05-30 10:38:43] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/715 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-30 10:38:44] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 2 ms to minimize.
[2024-05-30 10:38:44] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 2 ms to minimize.
[2024-05-30 10:38:44] [INFO ] Deduced a trap composed of 115 places in 124 ms of which 2 ms to minimize.
[2024-05-30 10:38:44] [INFO ] Deduced a trap composed of 113 places in 132 ms of which 2 ms to minimize.
[2024-05-30 10:38:44] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-30 10:38:44] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-30 10:38:45] [INFO ] Deduced a trap composed of 127 places in 130 ms of which 2 ms to minimize.
[2024-05-30 10:38:45] [INFO ] Deduced a trap composed of 149 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:38:45] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:38:45] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:38:45] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 2 ms to minimize.
[2024-05-30 10:38:46] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2024-05-30 10:38:46] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
[2024-05-30 10:38:46] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2024-05-30 10:38:46] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 2 ms to minimize.
[2024-05-30 10:38:46] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:38:46] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 1 ms to minimize.
[2024-05-30 10:38:47] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2024-05-30 10:38:47] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:38:47] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-30 10:38:48] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
[2024-05-30 10:38:48] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-05-30 10:38:48] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 2 ms to minimize.
[2024-05-30 10:38:48] [INFO ] Deduced a trap composed of 188 places in 156 ms of which 3 ms to minimize.
[2024-05-30 10:38:48] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 2 ms to minimize.
[2024-05-30 10:38:48] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-30 10:38:49] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 2 ms to minimize.
[2024-05-30 10:38:49] [INFO ] Deduced a trap composed of 169 places in 130 ms of which 2 ms to minimize.
[2024-05-30 10:38:49] [INFO ] Deduced a trap composed of 150 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:38:49] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:38:49] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
[2024-05-30 10:38:49] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2024-05-30 10:38:49] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-05-30 10:38:50] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:38:50] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2024-05-30 10:38:50] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-30 10:38:50] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:38:50] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:38:50] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:38:50] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/715 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-30 10:38:51] [INFO ] Deduced a trap composed of 153 places in 131 ms of which 2 ms to minimize.
[2024-05-30 10:38:51] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2024-05-30 10:38:51] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 2 ms to minimize.
[2024-05-30 10:38:52] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 2 ms to minimize.
[2024-05-30 10:38:52] [INFO ] Deduced a trap composed of 100 places in 168 ms of which 3 ms to minimize.
SMT process timed out in 60355ms, After SMT, problems are : Problem set: 0 solved, 963 unsolved
Search for dead transitions found 0 dead transitions in 60362ms
Starting structural reductions in SI_CTL mode, iteration 1 : 715/1699 places, 964/1949 transitions.
Applied a total of 0 rules in 20 ms. Remains 715 /715 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 61799 ms. Remains : 715/1699 places, 964/1949 transitions.
[2024-05-30 10:38:52] [INFO ] Flatten gal took : 30 ms
[2024-05-30 10:38:52] [INFO ] Flatten gal took : 32 ms
[2024-05-30 10:38:52] [INFO ] Input system was already deterministic with 964 transitions.
[2024-05-30 10:38:52] [INFO ] Flatten gal took : 31 ms
[2024-05-30 10:38:52] [INFO ] Flatten gal took : 31 ms
[2024-05-30 10:38:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality7142431716835053102.gal : 4 ms
[2024-05-30 10:38:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality11804181334791928718.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7142431716835053102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11804181334791928718.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:39:22] [INFO ] Flatten gal took : 32 ms
[2024-05-30 10:39:22] [INFO ] Applying decomposition
[2024-05-30 10:39:22] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph303109283022527167.txt' '-o' '/tmp/graph303109283022527167.bin' '-w' '/tmp/graph303109283022527167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph303109283022527167.bin' '-l' '-1' '-v' '-w' '/tmp/graph303109283022527167.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:39:22] [INFO ] Decomposing Gal with order
[2024-05-30 10:39:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:39:22] [INFO ] Removed a total of 1064 redundant transitions.
[2024-05-30 10:39:22] [INFO ] Flatten gal took : 39 ms
[2024-05-30 10:39:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 866 labels/synchronizations in 25 ms.
[2024-05-30 10:39:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality4944436035629818486.gal : 6 ms
[2024-05-30 10:39:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4301574805623718902.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4944436035629818486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4301574805623718902.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1662 transition count 1912
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1662 transition count 1912
Applied a total of 74 rules in 111 ms. Remains 1662 /1699 variables (removed 37) and now considering 1912/1949 (removed 37) transitions.
// Phase 1: matrix 1912 rows 1662 cols
[2024-05-30 10:39:52] [INFO ] Computed 201 invariants in 14 ms
[2024-05-30 10:39:53] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-30 10:39:53] [INFO ] Invariant cache hit.
[2024-05-30 10:39:54] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned []
Implicit Place search using SMT with State Equation took 1978 ms to find 0 implicit places.
Running 1911 sub problems to find dead transitions.
[2024-05-30 10:39:54] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1661/3574 variables, and 0 constraints, problems are : Problem set: 0 solved, 1911 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1662 constraints, PredecessorRefiner: 1911/1911 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1911 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1661/3574 variables, and 0 constraints, problems are : Problem set: 0 solved, 1911 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1662 constraints, PredecessorRefiner: 0/1911 constraints, Known Traps: 0/0 constraints]
After SMT, in 60523ms problems are : Problem set: 0 solved, 1911 unsolved
Search for dead transitions found 0 dead transitions in 60538ms
Starting structural reductions in LTL mode, iteration 1 : 1662/1699 places, 1912/1949 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62632 ms. Remains : 1662/1699 places, 1912/1949 transitions.
[2024-05-30 10:40:55] [INFO ] Flatten gal took : 41 ms
[2024-05-30 10:40:55] [INFO ] Flatten gal took : 43 ms
[2024-05-30 10:40:55] [INFO ] Input system was already deterministic with 1912 transitions.
[2024-05-30 10:40:55] [INFO ] Flatten gal took : 41 ms
[2024-05-30 10:40:55] [INFO ] Flatten gal took : 43 ms
[2024-05-30 10:40:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality3511706152702936664.gal : 6 ms
[2024-05-30 10:40:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality8586946563290994090.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3511706152702936664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8586946563290994090.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:41:25] [INFO ] Flatten gal took : 45 ms
[2024-05-30 10:41:25] [INFO ] Applying decomposition
[2024-05-30 10:41:25] [INFO ] Flatten gal took : 43 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/graph15132154617155605389.txt' '-o' '/tmp/graph15132154617155605389.bin' '-w' '/tmp/graph15132154617155605389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15132154617155605389.bin' '-l' '-1' '-v' '-w' '/tmp/graph15132154617155605389.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:41:25] [INFO ] Decomposing Gal with order
[2024-05-30 10:41:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:41:26] [INFO ] Removed a total of 1791 redundant transitions.
[2024-05-30 10:41:26] [INFO ] Flatten gal took : 66 ms
[2024-05-30 10:41:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-30 10:41:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality15583991084590961171.gal : 11 ms
[2024-05-30 10:41:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality7392025545259658484.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15583991084590961171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7392025545259658484.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1698 transition count 1747
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1497 transition count 1747
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 402 place count 1497 transition count 1498
Deduced a syphon composed of 249 places in 2 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 900 place count 1248 transition count 1498
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 946 place count 1202 transition count 1452
Iterating global reduction 2 with 46 rules applied. Total rules applied 992 place count 1202 transition count 1452
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 992 place count 1202 transition count 1436
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1024 place count 1186 transition count 1436
Performed 481 Post agglomeration using F-continuation condition.Transition count delta: 481
Deduced a syphon composed of 481 places in 2 ms
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 2 with 962 rules applied. Total rules applied 1986 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1988 place count 703 transition count 953
Applied a total of 1988 rules in 340 ms. Remains 703 /1699 variables (removed 996) and now considering 953/1949 (removed 996) transitions.
// Phase 1: matrix 953 rows 703 cols
[2024-05-30 10:41:56] [INFO ] Computed 201 invariants in 10 ms
[2024-05-30 10:41:56] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-30 10:41:56] [INFO ] Invariant cache hit.
[2024-05-30 10:41:57] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
[2024-05-30 10:41:57] [INFO ] Redundant transitions in 162 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 950 sub problems to find dead transitions.
// Phase 1: matrix 952 rows 703 cols
[2024-05-30 10:41:57] [INFO ] Computed 201 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:42:07] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 3 ms to minimize.
[2024-05-30 10:42:07] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-05-30 10:42:07] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:42:08] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 2 ms to minimize.
[2024-05-30 10:42:08] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-05-30 10:42:08] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 2 ms to minimize.
[2024-05-30 10:42:08] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-05-30 10:42:09] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 2 ms to minimize.
[2024-05-30 10:42:09] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:42:09] [INFO ] Deduced a trap composed of 107 places in 164 ms of which 2 ms to minimize.
[2024-05-30 10:42:09] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 2 ms to minimize.
[2024-05-30 10:42:09] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 3 ms to minimize.
[2024-05-30 10:42:09] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 3 ms to minimize.
[2024-05-30 10:42:09] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:42:10] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 2 ms to minimize.
[2024-05-30 10:42:10] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 2 ms to minimize.
[2024-05-30 10:42:10] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 2 ms to minimize.
[2024-05-30 10:42:10] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:42:10] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 2 ms to minimize.
[2024-05-30 10:42:11] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:42:11] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 2 ms to minimize.
[2024-05-30 10:42:11] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:42:11] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 2 ms to minimize.
[2024-05-30 10:42:11] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 2 ms to minimize.
[2024-05-30 10:42:12] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:42:12] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 3 ms to minimize.
[2024-05-30 10:42:12] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 2 ms to minimize.
[2024-05-30 10:42:12] [INFO ] Deduced a trap composed of 103 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:42:12] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2024-05-30 10:42:12] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:42:13] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 2 ms to minimize.
[2024-05-30 10:42:13] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:42:13] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 2 ms to minimize.
[2024-05-30 10:42:13] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 3 ms to minimize.
[2024-05-30 10:42:13] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
[2024-05-30 10:42:13] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 2 ms to minimize.
[2024-05-30 10:42:14] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 2 ms to minimize.
[2024-05-30 10:42:14] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 2 ms to minimize.
[2024-05-30 10:42:14] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-05-30 10:42:14] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:42:15] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-05-30 10:42:15] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 2 ms to minimize.
[2024-05-30 10:42:15] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 2 ms to minimize.
[2024-05-30 10:42:15] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 2 ms to minimize.
[2024-05-30 10:42:16] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 3 ms to minimize.
[2024-05-30 10:42:16] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:42:16] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:42:16] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 3 ms to minimize.
[2024-05-30 10:42:16] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:42:17] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 3 ms to minimize.
[2024-05-30 10:42:17] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:42:17] [INFO ] Deduced a trap composed of 108 places in 159 ms of which 3 ms to minimize.
[2024-05-30 10:42:17] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 2 ms to minimize.
[2024-05-30 10:42:17] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 2 ms to minimize.
[2024-05-30 10:42:17] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 3 ms to minimize.
[2024-05-30 10:42:18] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 3 ms to minimize.
[2024-05-30 10:42:18] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 3 ms to minimize.
[2024-05-30 10:42:18] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 2 ms to minimize.
[2024-05-30 10:42:18] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 2 ms to minimize.
[2024-05-30 10:42:19] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1655 variables, and 260 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/201 constraints, State Equation: 0/703 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 60/260 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:42:28] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2024-05-30 10:42:29] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 3 ms to minimize.
[2024-05-30 10:42:29] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2024-05-30 10:42:29] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 3 ms to minimize.
[2024-05-30 10:42:29] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 3 ms to minimize.
[2024-05-30 10:42:29] [INFO ] Deduced a trap composed of 103 places in 154 ms of which 2 ms to minimize.
[2024-05-30 10:42:30] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 3 ms to minimize.
[2024-05-30 10:42:30] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 3 ms to minimize.
[2024-05-30 10:42:30] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-05-30 10:42:30] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:42:30] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 3 ms to minimize.
[2024-05-30 10:42:30] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2024-05-30 10:42:31] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:42:31] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:42:31] [INFO ] Deduced a trap composed of 105 places in 157 ms of which 2 ms to minimize.
[2024-05-30 10:42:31] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-05-30 10:42:31] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:42:31] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:42:31] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:42:32] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:42:32] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 3 ms to minimize.
[2024-05-30 10:42:32] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 3 ms to minimize.
[2024-05-30 10:42:33] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 2 ms to minimize.
[2024-05-30 10:42:33] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 2 ms to minimize.
[2024-05-30 10:42:33] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 3 ms to minimize.
[2024-05-30 10:42:33] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:42:33] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 2 ms to minimize.
[2024-05-30 10:42:34] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 3 ms to minimize.
[2024-05-30 10:42:34] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 3 ms to minimize.
[2024-05-30 10:42:34] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:42:34] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 3 ms to minimize.
[2024-05-30 10:42:35] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 2 ms to minimize.
[2024-05-30 10:42:35] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-05-30 10:42:35] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 3 ms to minimize.
[2024-05-30 10:42:35] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 2 ms to minimize.
[2024-05-30 10:42:35] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 3 ms to minimize.
[2024-05-30 10:42:36] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 3 ms to minimize.
[2024-05-30 10:42:36] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 3 ms to minimize.
[2024-05-30 10:42:36] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 2 ms to minimize.
[2024-05-30 10:42:36] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:42:37] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:42:37] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 3 ms to minimize.
[2024-05-30 10:42:37] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:42:37] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:42:38] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:42:38] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 3 ms to minimize.
[2024-05-30 10:42:38] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 3 ms to minimize.
[2024-05-30 10:42:38] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:42:38] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:42:38] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 2 ms to minimize.
[2024-05-30 10:42:39] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 3 ms to minimize.
[2024-05-30 10:42:39] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:42:39] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 2 ms to minimize.
[2024-05-30 10:42:39] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-05-30 10:42:40] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
[2024-05-30 10:42:40] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:42:40] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 2 ms to minimize.
[2024-05-30 10:42:40] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 3 ms to minimize.
[2024-05-30 10:42:40] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:42:40] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:42:41] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 3 ms to minimize.
[2024-05-30 10:42:42] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 3 ms to minimize.
[2024-05-30 10:42:42] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-05-30 10:42:42] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:42:42] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:42:42] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:42:43] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:42:43] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 3 ms to minimize.
[2024-05-30 10:42:43] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:42:43] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:42:43] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:42:43] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:42:44] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 3 ms to minimize.
[2024-05-30 10:42:44] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 3 ms to minimize.
[2024-05-30 10:42:44] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-05-30 10:42:44] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-30 10:42:44] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-05-30 10:42:44] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:42:44] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-05-30 10:42:45] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:42:46] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-30 10:42:46] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:42:46] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 2 ms to minimize.
[2024-05-30 10:42:46] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 2 ms to minimize.
[2024-05-30 10:42:47] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:42:47] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 3 ms to minimize.
[2024-05-30 10:42:47] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:42:47] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:42:47] [INFO ] Deduced a trap composed of 92 places in 170 ms of which 2 ms to minimize.
[2024-05-30 10:42:48] [INFO ] Deduced a trap composed of 94 places in 171 ms of which 3 ms to minimize.
[2024-05-30 10:42:48] [INFO ] Deduced a trap composed of 93 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:42:48] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-30 10:42:48] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 2 ms to minimize.
[2024-05-30 10:42:48] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-05-30 10:42:48] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-05-30 10:42:49] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:42:49] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:42:49] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:42:49] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-30 10:42:49] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:42:51] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:42:51] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 3 ms to minimize.
[2024-05-30 10:42:51] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 3 ms to minimize.
[2024-05-30 10:42:51] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-05-30 10:42:51] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-05-30 10:42:51] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 3 ms to minimize.
[2024-05-30 10:42:52] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 3 ms to minimize.
[2024-05-30 10:42:52] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 2 ms to minimize.
[2024-05-30 10:42:52] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 3 ms to minimize.
[2024-05-30 10:42:52] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 3 ms to minimize.
[2024-05-30 10:42:52] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 3 ms to minimize.
[2024-05-30 10:42:53] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 3 ms to minimize.
[2024-05-30 10:42:53] [INFO ] Deduced a trap composed of 109 places in 164 ms of which 3 ms to minimize.
[2024-05-30 10:42:53] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 2 ms to minimize.
[2024-05-30 10:42:53] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 2 ms to minimize.
[2024-05-30 10:42:53] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:42:53] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:42:54] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 3 ms to minimize.
[2024-05-30 10:42:54] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 3 ms to minimize.
[2024-05-30 10:42:54] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:42:55] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:42:55] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 3 ms to minimize.
[2024-05-30 10:42:56] [INFO ] Deduced a trap composed of 86 places in 176 ms of which 3 ms to minimize.
[2024-05-30 10:42:56] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-30 10:42:56] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 2 ms to minimize.
[2024-05-30 10:42:56] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2024-05-30 10:42:57] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 2 ms to minimize.
[2024-05-30 10:42:57] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-05-30 10:42:57] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 3 ms to minimize.
[2024-05-30 10:42:57] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 3 ms to minimize.
[2024-05-30 10:42:57] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 2 ms to minimize.
[2024-05-30 10:42:57] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2024-05-30 10:42:58] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 2 ms to minimize.
SMT process timed out in 60362ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Starting structural reductions in SI_CTL mode, iteration 1 : 703/1699 places, 952/1949 transitions.
Applied a total of 0 rules in 20 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 61849 ms. Remains : 703/1699 places, 952/1949 transitions.
[2024-05-30 10:42:58] [INFO ] Flatten gal took : 22 ms
[2024-05-30 10:42:58] [INFO ] Flatten gal took : 28 ms
[2024-05-30 10:42:58] [INFO ] Input system was already deterministic with 952 transitions.
[2024-05-30 10:42:58] [INFO ] Flatten gal took : 23 ms
[2024-05-30 10:42:58] [INFO ] Flatten gal took : 23 ms
[2024-05-30 10:42:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality4402267331254243021.gal : 5 ms
[2024-05-30 10:42:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality1994631612415561348.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4402267331254243021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1994631612415561348.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:43:28] [INFO ] Flatten gal took : 23 ms
[2024-05-30 10:43:28] [INFO ] Applying decomposition
[2024-05-30 10:43:28] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8276048310556368647.txt' '-o' '/tmp/graph8276048310556368647.bin' '-w' '/tmp/graph8276048310556368647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8276048310556368647.bin' '-l' '-1' '-v' '-w' '/tmp/graph8276048310556368647.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:43:28] [INFO ] Decomposing Gal with order
[2024-05-30 10:43:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:43:28] [INFO ] Removed a total of 1048 redundant transitions.
[2024-05-30 10:43:28] [INFO ] Flatten gal took : 36 ms
[2024-05-30 10:43:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 766 labels/synchronizations in 5 ms.
[2024-05-30 10:43:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality15282250155700703507.gal : 4 ms
[2024-05-30 10:43:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality1721166656078777798.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15282250155700703507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1721166656078777798.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1653 transition count 1903
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1653 transition count 1903
Applied a total of 92 rules in 113 ms. Remains 1653 /1699 variables (removed 46) and now considering 1903/1949 (removed 46) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2024-05-30 10:43:58] [INFO ] Computed 201 invariants in 12 ms
[2024-05-30 10:43:59] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-30 10:43:59] [INFO ] Invariant cache hit.
[2024-05-30 10:44:00] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 10:44:00] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60518ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60534ms
Starting structural reductions in LTL mode, iteration 1 : 1653/1699 places, 1903/1949 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62521 ms. Remains : 1653/1699 places, 1903/1949 transitions.
[2024-05-30 10:45:01] [INFO ] Flatten gal took : 41 ms
[2024-05-30 10:45:01] [INFO ] Flatten gal took : 44 ms
[2024-05-30 10:45:01] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 10:45:01] [INFO ] Flatten gal took : 43 ms
[2024-05-30 10:45:01] [INFO ] Flatten gal took : 43 ms
[2024-05-30 10:45:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality15475302307329980697.gal : 7 ms
[2024-05-30 10:45:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality10610819727411181082.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15475302307329980697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10610819727411181082.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:45:31] [INFO ] Flatten gal took : 44 ms
[2024-05-30 10:45:31] [INFO ] Applying decomposition
[2024-05-30 10:45:31] [INFO ] Flatten gal took : 42 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/graph14562731428143396813.txt' '-o' '/tmp/graph14562731428143396813.bin' '-w' '/tmp/graph14562731428143396813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14562731428143396813.bin' '-l' '-1' '-v' '-w' '/tmp/graph14562731428143396813.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:45:31] [INFO ] Decomposing Gal with order
[2024-05-30 10:45:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:45:31] [INFO ] Removed a total of 1791 redundant transitions.
[2024-05-30 10:45:31] [INFO ] Flatten gal took : 67 ms
[2024-05-30 10:45:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 10:45:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality15803042980781452622.gal : 11 ms
[2024-05-30 10:45:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality3856345244177330498.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15803042980781452622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3856345244177330498.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1665 transition count 1915
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1665 transition count 1915
Applied a total of 68 rules in 102 ms. Remains 1665 /1699 variables (removed 34) and now considering 1915/1949 (removed 34) transitions.
// Phase 1: matrix 1915 rows 1665 cols
[2024-05-30 10:46:02] [INFO ] Computed 201 invariants in 4 ms
[2024-05-30 10:46:02] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-30 10:46:02] [INFO ] Invariant cache hit.
[2024-05-30 10:46:03] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
Running 1914 sub problems to find dead transitions.
[2024-05-30 10:46:03] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1664/3580 variables, and 0 constraints, problems are : Problem set: 0 solved, 1914 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 1914/1914 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1914 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1664/3580 variables, and 0 constraints, problems are : Problem set: 0 solved, 1914 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 0/1914 constraints, Known Traps: 0/0 constraints]
After SMT, in 60548ms problems are : Problem set: 0 solved, 1914 unsolved
Search for dead transitions found 0 dead transitions in 60563ms
Starting structural reductions in LTL mode, iteration 1 : 1665/1699 places, 1915/1949 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62563 ms. Remains : 1665/1699 places, 1915/1949 transitions.
[2024-05-30 10:47:04] [INFO ] Flatten gal took : 41 ms
[2024-05-30 10:47:04] [INFO ] Flatten gal took : 50 ms
[2024-05-30 10:47:04] [INFO ] Input system was already deterministic with 1915 transitions.
[2024-05-30 10:47:04] [INFO ] Flatten gal took : 43 ms
[2024-05-30 10:47:04] [INFO ] Flatten gal took : 42 ms
[2024-05-30 10:47:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality2826565602287549387.gal : 7 ms
[2024-05-30 10:47:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality10556451116554949227.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2826565602287549387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10556451116554949227.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:47:34] [INFO ] Flatten gal took : 46 ms
[2024-05-30 10:47:34] [INFO ] Applying decomposition
[2024-05-30 10:47:34] [INFO ] Flatten gal took : 42 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/graph13006359198761653586.txt' '-o' '/tmp/graph13006359198761653586.bin' '-w' '/tmp/graph13006359198761653586.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13006359198761653586.bin' '-l' '-1' '-v' '-w' '/tmp/graph13006359198761653586.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:47:35] [INFO ] Decomposing Gal with order
[2024-05-30 10:47:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:47:35] [INFO ] Removed a total of 1791 redundant transitions.
[2024-05-30 10:47:35] [INFO ] Flatten gal took : 66 ms
[2024-05-30 10:47:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 10:47:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality3998978772827949033.gal : 11 ms
[2024-05-30 10:47:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality10056114711123097587.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3998978772827949033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10056114711123097587.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1698 transition count 1749
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1499 transition count 1749
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 398 place count 1499 transition count 1501
Deduced a syphon composed of 248 places in 2 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 894 place count 1251 transition count 1501
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 940 place count 1205 transition count 1455
Iterating global reduction 2 with 46 rules applied. Total rules applied 986 place count 1205 transition count 1455
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 986 place count 1205 transition count 1440
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 1016 place count 1190 transition count 1440
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 1 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 2 with 960 rules applied. Total rules applied 1976 place count 710 transition count 960
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1978 place count 708 transition count 958
Applied a total of 1978 rules in 231 ms. Remains 708 /1699 variables (removed 991) and now considering 958/1949 (removed 991) transitions.
// Phase 1: matrix 958 rows 708 cols
[2024-05-30 10:48:05] [INFO ] Computed 201 invariants in 2 ms
[2024-05-30 10:48:05] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-30 10:48:05] [INFO ] Invariant cache hit.
[2024-05-30 10:48:06] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2024-05-30 10:48:06] [INFO ] Redundant transitions in 140 ms returned [957]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 954 sub problems to find dead transitions.
// Phase 1: matrix 957 rows 708 cols
[2024-05-30 10:48:06] [INFO ] Computed 201 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/706 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:48:16] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-30 10:48:17] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2024-05-30 10:48:17] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:48:17] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:48:17] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:48:17] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:48:17] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:48:17] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:48:17] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:48:18] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-05-30 10:48:18] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-30 10:48:18] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:48:18] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:48:18] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-30 10:48:18] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2024-05-30 10:48:18] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-30 10:48:19] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2024-05-30 10:48:19] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:48:19] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-30 10:48:19] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/706 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:48:19] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:48:19] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:48:19] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:48:20] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-30 10:48:20] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2024-05-30 10:48:20] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2024-05-30 10:48:20] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-05-30 10:48:20] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2024-05-30 10:48:20] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:48:20] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-30 10:48:20] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:48:21] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:48:21] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:48:21] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:48:21] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2024-05-30 10:48:21] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-30 10:48:21] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:48:21] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2024-05-30 10:48:21] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:48:22] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/706 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:48:22] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2024-05-30 10:48:22] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:48:22] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:48:23] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2024-05-30 10:48:23] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:48:23] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:48:23] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:48:23] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:48:23] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:48:23] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2024-05-30 10:48:23] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-30 10:48:24] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2024-05-30 10:48:24] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:48:24] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:48:24] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:48:24] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:48:24] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:48:24] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:48:25] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:48:25] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/706 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:48:34] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-30 10:48:34] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:48:34] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:48:35] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:48:35] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:48:35] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-30 10:48:35] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:48:35] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:48:35] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:48:35] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:48:35] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:48:36] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-30 10:48:36] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:48:36] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-30 10:48:36] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:48:36] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-30 10:48:36] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:48:36] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
SMT process timed out in 30292ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 30301ms
Starting structural reductions in SI_CTL mode, iteration 1 : 708/1699 places, 957/1949 transitions.
Applied a total of 0 rules in 17 ms. Remains 708 /708 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 31642 ms. Remains : 708/1699 places, 957/1949 transitions.
[2024-05-30 10:48:37] [INFO ] Flatten gal took : 22 ms
[2024-05-30 10:48:37] [INFO ] Flatten gal took : 23 ms
[2024-05-30 10:48:37] [INFO ] Input system was already deterministic with 957 transitions.
[2024-05-30 10:48:37] [INFO ] Flatten gal took : 23 ms
[2024-05-30 10:48:37] [INFO ] Flatten gal took : 23 ms
[2024-05-30 10:48:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality2310098481194265112.gal : 4 ms
[2024-05-30 10:48:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality7288596110081784003.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2310098481194265112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7288596110081784003.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:49:07] [INFO ] Flatten gal took : 23 ms
[2024-05-30 10:49:07] [INFO ] Applying decomposition
[2024-05-30 10:49:07] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8590452888355886960.txt' '-o' '/tmp/graph8590452888355886960.bin' '-w' '/tmp/graph8590452888355886960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8590452888355886960.bin' '-l' '-1' '-v' '-w' '/tmp/graph8590452888355886960.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:49:07] [INFO ] Decomposing Gal with order
[2024-05-30 10:49:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:49:07] [INFO ] Removed a total of 1060 redundant transitions.
[2024-05-30 10:49:07] [INFO ] Flatten gal took : 37 ms
[2024-05-30 10:49:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 916 labels/synchronizations in 6 ms.
[2024-05-30 10:49:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality721731498212884871.gal : 4 ms
[2024-05-30 10:49:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality5827525360394138923.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality721731498212884871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5827525360394138923.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 10:49:37] [INFO ] Flatten gal took : 44 ms
[2024-05-30 10:49:37] [INFO ] Flatten gal took : 44 ms
[2024-05-30 10:49:37] [INFO ] Applying decomposition
[2024-05-30 10:49:37] [INFO ] Flatten gal took : 43 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/graph14600762593482142681.txt' '-o' '/tmp/graph14600762593482142681.bin' '-w' '/tmp/graph14600762593482142681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14600762593482142681.bin' '-l' '-1' '-v' '-w' '/tmp/graph14600762593482142681.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:49:37] [INFO ] Decomposing Gal with order
[2024-05-30 10:49:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:49:37] [INFO ] Removed a total of 1791 redundant transitions.
[2024-05-30 10:49:37] [INFO ] Flatten gal took : 69 ms
[2024-05-30 10:49:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 10:49:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality2009174872493359812.gal : 10 ms
[2024-05-30 10:49:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality16028637149256548242.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2009174872493359812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16028637149256548242.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-30 10:58:57] [INFO ] Applying decomposition
[2024-05-30 10:58:57] [INFO ] Flatten gal took : 53 ms
[2024-05-30 10:58:57] [INFO ] Decomposing Gal with order
[2024-05-30 10:58:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:58:57] [INFO ] Removed a total of 1047 redundant transitions.
[2024-05-30 10:58:57] [INFO ] Flatten gal took : 61 ms
[2024-05-30 10:58:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 1592 labels/synchronizations in 14 ms.
[2024-05-30 10:58:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality2977246729727027656.gal : 9 ms
[2024-05-30 10:58:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality3473222949944044453.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2977246729727027656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3473222949944044453.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-30 11:14:41] [INFO ] Flatten gal took : 226 ms
[2024-05-30 11:14:41] [INFO ] Input system was already deterministic with 1949 transitions.
[2024-05-30 11:14:41] [INFO ] Transformed 1699 places.
[2024-05-30 11:14:41] [INFO ] Transformed 1949 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 11:14:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality16769864760626771948.gal : 6 ms
[2024-05-30 11:14:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality13223247825195311553.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16769864760626771948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13223247825195311553.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="ShieldRVs-PT-050B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldRVs-PT-050B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683762000857"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;