About the Execution of ITS-Tools for Peterson-COL-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.199 | 3190501.00 | 3628109.00 | 10427.60 | 7 7 7 7 7 6 ? 7 ? 7 7 6 ? ? 7 7 | 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.r268-smll-171654407200237.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 Peterson-COL-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407200237
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.9K Apr 12 02:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 12 02:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 02:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 02:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 46K 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-6-UpperBounds-00
FORMULA_NAME Peterson-COL-6-UpperBounds-01
FORMULA_NAME Peterson-COL-6-UpperBounds-02
FORMULA_NAME Peterson-COL-6-UpperBounds-03
FORMULA_NAME Peterson-COL-6-UpperBounds-04
FORMULA_NAME Peterson-COL-6-UpperBounds-05
FORMULA_NAME Peterson-COL-6-UpperBounds-06
FORMULA_NAME Peterson-COL-6-UpperBounds-07
FORMULA_NAME Peterson-COL-6-UpperBounds-08
FORMULA_NAME Peterson-COL-6-UpperBounds-09
FORMULA_NAME Peterson-COL-6-UpperBounds-10
FORMULA_NAME Peterson-COL-6-UpperBounds-11
FORMULA_NAME Peterson-COL-6-UpperBounds-12
FORMULA_NAME Peterson-COL-6-UpperBounds-13
FORMULA_NAME Peterson-COL-6-UpperBounds-14
FORMULA_NAME Peterson-COL-6-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716751553205
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-26 19:25:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 19:25:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 19:25:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 19:25:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 19:25:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1057 ms
[2024-05-26 19:25:56] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-05-26 19:25:56] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2024-05-26 19:25:56] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2024-05-26 19:25:57] [INFO ] Computed 1 invariants in 10 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 7, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 6]
FORMULA Peterson-COL-6-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-26 19:25:57] [INFO ] Invariant cache hit.
[2024-05-26 19:25:57] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-26 19:25:57] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-26 19:25:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-26 19:25:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:25:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 19:25:57] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-26 19:25:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-26 19:25:57] [INFO ] Added : 11 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 16 ms.
[2024-05-26 19:25:57] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 19:25:57] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-26 19:25:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-26 19:25:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:25:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 19:25:57] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-26 19:25:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-26 19:25:57] [INFO ] Added : 11 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 10 ms.
[2024-05-26 19:25:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 19:25:57] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-26 19:25:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 19:25:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:25:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 19:25:57] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-26 19:25:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 19:25:57] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 19:25:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 19:25:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 19:25:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 19:25:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:25:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 19:25:58] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-26 19:25:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 19:25:58] [INFO ] Added : 11 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 10 ms.
[2024-05-26 19:25:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 19:25:58] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 19:25:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 19:25:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:25:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 19:25:58] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-26 19:25:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-26 19:25:58] [INFO ] Added : 12 causal constraints over 4 iterations in 31 ms. Result :sat
Minimization took 10 ms.
[2024-05-26 19:25:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 19:25:58] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 19:25:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 19:25:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:25:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 19:25:58] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-26 19:25:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 19:25:58] [INFO ] Added : 11 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 19:25:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 19:25:58] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-26 19:25:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 19:25:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:25:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 19:25:58] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-26 19:25:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 19:25:58] [INFO ] Added : 11 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7]
Domain [Process(7), Tour(6), Process(7)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 6)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 19:25:58] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions 6608 arcs in 141 ms.
[2024-05-26 19:25:58] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Deduced a syphon composed of 42 places in 36 ms
Reduce places removed 42 places and 84 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7]
[2024-05-26 19:25:58] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-26 19:25:58] [INFO ] Computed 27 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7]
RANDOM walk for 10000 steps (2 resets) in 394 ms. (25 steps per ms)
FORMULA Peterson-COL-6-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 302 ms. (165 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 6, 1, 4] Max Struct:[7, 7, 7, 7]
[2024-05-26 19:25:59] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-26 19:25:59] [INFO ] Invariant cache hit.
[2024-05-26 19:25:59] [INFO ] [Real]Absence check using 20 positive place invariants in 42 ms returned sat
[2024-05-26 19:25:59] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 24 ms returned sat
[2024-05-26 19:26:01] [INFO ] [Real]Absence check using state equation in 1107 ms returned sat
[2024-05-26 19:26:01] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:26:01] [INFO ] [Real]Added 330 Read/Feed constraints in 294 ms returned sat
[2024-05-26 19:26:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:26:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 38 ms returned sat
[2024-05-26 19:26:01] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-26 19:26:02] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2024-05-26 19:26:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 19:26:03] [INFO ] [Nat]Added 330 Read/Feed constraints in 723 ms returned sat
[2024-05-26 19:26:04] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 277 ms.
[2024-05-26 19:26:05] [INFO ] Added : 5 causal constraints over 1 iterations in 1358 ms. Result :sat
Minimization took 577 ms.
[2024-05-26 19:26:05] [INFO ] [Real]Absence check using 20 positive place invariants in 46 ms returned sat
[2024-05-26 19:26:05] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-26 19:26:06] [INFO ] [Real]Absence check using state equation in 998 ms returned sat
[2024-05-26 19:26:07] [INFO ] [Real]Added 330 Read/Feed constraints in 395 ms returned sat
[2024-05-26 19:26:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:26:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 47 ms returned sat
[2024-05-26 19:26:07] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-26 19:26:08] [INFO ] [Nat]Absence check using state equation in 934 ms returned sat
[2024-05-26 19:26:09] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 19:26:09] [INFO ] [Nat]Added 330 Read/Feed constraints in 595 ms returned sat
[2024-05-26 19:26:10] [INFO ] Deduced a trap composed of 17 places in 1312 ms of which 158 ms to minimize.
[2024-05-26 19:26:12] [INFO ] Deduced a trap composed of 31 places in 1452 ms of which 20 ms to minimize.
[2024-05-26 19:26:13] [INFO ] Deduced a trap composed of 31 places in 1402 ms of which 17 ms to minimize.
[2024-05-26 19:26:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-26 19:26:14] [INFO ] [Real]Absence check using 20 positive place invariants in 51 ms returned sat
[2024-05-26 19:26:14] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-26 19:26:15] [INFO ] [Real]Absence check using state equation in 1039 ms returned sat
[2024-05-26 19:26:15] [INFO ] [Real]Added 330 Read/Feed constraints in 119 ms returned sat
[2024-05-26 19:26:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:26:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 52 ms returned sat
[2024-05-26 19:26:16] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 32 ms returned sat
[2024-05-26 19:26:17] [INFO ] [Nat]Absence check using state equation in 1102 ms returned sat
[2024-05-26 19:26:17] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-26 19:26:17] [INFO ] [Nat]Added 330 Read/Feed constraints in 740 ms returned sat
[2024-05-26 19:26:19] [INFO ] Deduced a trap composed of 16 places in 1052 ms of which 16 ms to minimize.
[2024-05-26 19:26:20] [INFO ] Deduced a trap composed of 29 places in 1298 ms of which 15 ms to minimize.
[2024-05-26 19:26:22] [INFO ] Deduced a trap composed of 78 places in 1328 ms of which 14 ms to minimize.
[2024-05-26 19:26:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-26 19:26:22] [INFO ] [Real]Absence check using 20 positive place invariants in 46 ms returned sat
[2024-05-26 19:26:22] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-26 19:26:23] [INFO ] [Real]Absence check using state equation in 1135 ms returned sat
[2024-05-26 19:26:23] [INFO ] [Real]Added 330 Read/Feed constraints in 84 ms returned sat
[2024-05-26 19:26:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:26:24] [INFO ] [Nat]Absence check using 20 positive place invariants in 53 ms returned sat
[2024-05-26 19:26:24] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-26 19:26:25] [INFO ] [Nat]Absence check using state equation in 1050 ms returned sat
[2024-05-26 19:26:25] [INFO ] [Nat]Added 330 Read/Feed constraints in 440 ms returned sat
[2024-05-26 19:26:25] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 250 ms.
[2024-05-26 19:26:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[6, 6, 1, 4] Max Struct:[7, 7, 7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 6, 1, 4] Max Struct:[7, 7, 7, 7]
Support contains 637 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 257 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 1330/1330 places, 2030/2030 transitions.
[2024-05-26 19:26:29] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-26 19:26:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 6, 1, 4] Max Struct:[7, 7, 7, 7]
RANDOM walk for 1000000 steps (2 resets) in 12268 ms. (81 steps per ms)
FORMULA Peterson-COL-6-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2728957 steps (6 resets) in 11343 ms. (240 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 1, 5] Max Struct:[7, 7, 7]
[2024-05-26 19:26:52] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-26 19:26:52] [INFO ] Invariant cache hit.
[2024-05-26 19:26:52] [INFO ] [Real]Absence check using 20 positive place invariants in 50 ms returned sat
[2024-05-26 19:26:52] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-26 19:26:54] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2024-05-26 19:26:54] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:26:54] [INFO ] [Real]Added 330 Read/Feed constraints in 409 ms returned sat
[2024-05-26 19:26:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:26:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 43 ms returned sat
[2024-05-26 19:26:54] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-26 19:26:55] [INFO ] [Nat]Absence check using state equation in 962 ms returned sat
[2024-05-26 19:26:56] [INFO ] [Nat]Added 330 Read/Feed constraints in 661 ms returned sat
[2024-05-26 19:26:57] [INFO ] Deduced a trap composed of 17 places in 1231 ms of which 17 ms to minimize.
[2024-05-26 19:26:59] [INFO ] Deduced a trap composed of 31 places in 1224 ms of which 18 ms to minimize.
[2024-05-26 19:27:00] [INFO ] Deduced a trap composed of 31 places in 1274 ms of which 10 ms to minimize.
[2024-05-26 19:27:01] [INFO ] Deduced a trap composed of 31 places in 962 ms of which 11 ms to minimize.
[2024-05-26 19:27:02] [INFO ] Deduced a trap composed of 32 places in 935 ms of which 9 ms to minimize.
[2024-05-26 19:27:03] [INFO ] Deduced a trap composed of 31 places in 1280 ms of which 15 ms to minimize.
[2024-05-26 19:27:05] [INFO ] Deduced a trap composed of 35 places in 1394 ms of which 16 ms to minimize.
[2024-05-26 19:27:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 8998 ms
[2024-05-26 19:27:05] [INFO ] [Real]Absence check using 20 positive place invariants in 50 ms returned sat
[2024-05-26 19:27:05] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-26 19:27:07] [INFO ] [Real]Absence check using state equation in 1152 ms returned sat
[2024-05-26 19:27:07] [INFO ] [Real]Added 330 Read/Feed constraints in 80 ms returned sat
[2024-05-26 19:27:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:27:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 33 ms returned sat
[2024-05-26 19:27:07] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-26 19:27:08] [INFO ] [Nat]Absence check using state equation in 984 ms returned sat
[2024-05-26 19:27:09] [INFO ] [Nat]Added 330 Read/Feed constraints in 956 ms returned sat
[2024-05-26 19:27:10] [INFO ] Deduced a trap composed of 16 places in 1004 ms of which 9 ms to minimize.
[2024-05-26 19:27:11] [INFO ] Deduced a trap composed of 29 places in 972 ms of which 9 ms to minimize.
[2024-05-26 19:27:12] [INFO ] Deduced a trap composed of 108 places in 994 ms of which 9 ms to minimize.
[2024-05-26 19:27:13] [INFO ] Deduced a trap composed of 62 places in 1182 ms of which 9 ms to minimize.
[2024-05-26 19:27:15] [INFO ] Deduced a trap composed of 106 places in 1067 ms of which 16 ms to minimize.
[2024-05-26 19:27:16] [INFO ] Deduced a trap composed of 129 places in 1324 ms of which 14 ms to minimize.
[2024-05-26 19:27:18] [INFO ] Deduced a trap composed of 145 places in 1303 ms of which 16 ms to minimize.
[2024-05-26 19:27:19] [INFO ] Deduced a trap composed of 19 places in 1192 ms of which 15 ms to minimize.
[2024-05-26 19:27:20] [INFO ] Deduced a trap composed of 15 places in 949 ms of which 12 ms to minimize.
[2024-05-26 19:27:21] [INFO ] Deduced a trap composed of 74 places in 1253 ms of which 14 ms to minimize.
[2024-05-26 19:27:23] [INFO ] Deduced a trap composed of 16 places in 1340 ms of which 14 ms to minimize.
[2024-05-26 19:27:24] [INFO ] Deduced a trap composed of 76 places in 1318 ms of which 15 ms to minimize.
[2024-05-26 19:27:26] [INFO ] Deduced a trap composed of 27 places in 1356 ms of which 16 ms to minimize.
[2024-05-26 19:27:27] [INFO ] Deduced a trap composed of 48 places in 1239 ms of which 16 ms to minimize.
[2024-05-26 19:27:29] [INFO ] Deduced a trap composed of 74 places in 1036 ms of which 9 ms to minimize.
[2024-05-26 19:27:30] [INFO ] Deduced a trap composed of 202 places in 1145 ms of which 15 ms to minimize.
[2024-05-26 19:27:31] [INFO ] Deduced a trap composed of 94 places in 1345 ms of which 16 ms to minimize.
[2024-05-26 19:27:32] [INFO ] Deduced a trap composed of 123 places in 1099 ms of which 9 ms to minimize.
[2024-05-26 19:27:34] [INFO ] Deduced a trap composed of 57 places in 1019 ms of which 10 ms to minimize.
[2024-05-26 19:27:36] [INFO ] Deduced a trap composed of 49 places in 1428 ms of which 16 ms to minimize.
[2024-05-26 19:27:37] [INFO ] Deduced a trap composed of 67 places in 1342 ms of which 15 ms to minimize.
[2024-05-26 19:27:38] [INFO ] Deduced a trap composed of 51 places in 1210 ms of which 11 ms to minimize.
[2024-05-26 19:27:40] [INFO ] Deduced a trap composed of 189 places in 1147 ms of which 16 ms to minimize.
[2024-05-26 19:27:41] [INFO ] Deduced a trap composed of 87 places in 1230 ms of which 14 ms to minimize.
[2024-05-26 19:27:42] [INFO ] Deduced a trap composed of 20 places in 1262 ms of which 9 ms to minimize.
[2024-05-26 19:27:44] [INFO ] Deduced a trap composed of 27 places in 1068 ms of which 14 ms to minimize.
[2024-05-26 19:27:45] [INFO ] Deduced a trap composed of 52 places in 1240 ms of which 10 ms to minimize.
[2024-05-26 19:27:46] [INFO ] Deduced a trap composed of 81 places in 1155 ms of which 17 ms to minimize.
[2024-05-26 19:27:48] [INFO ] Deduced a trap composed of 19 places in 1194 ms of which 10 ms to minimize.
[2024-05-26 19:27:49] [INFO ] Deduced a trap composed of 147 places in 1167 ms of which 15 ms to minimize.
[2024-05-26 19:27:50] [INFO ] Deduced a trap composed of 67 places in 1150 ms of which 9 ms to minimize.
[2024-05-26 19:27:51] [INFO ] Deduced a trap composed of 117 places in 1081 ms of which 16 ms to minimize.
[2024-05-26 19:27:53] [INFO ] Deduced a trap composed of 58 places in 1186 ms of which 16 ms to minimize.
[2024-05-26 19:27:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-26 19:27:53] [INFO ] [Real]Absence check using 20 positive place invariants in 53 ms returned sat
[2024-05-26 19:27:53] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-26 19:27:54] [INFO ] [Real]Absence check using state equation in 1069 ms returned sat
[2024-05-26 19:27:54] [INFO ] [Real]Added 330 Read/Feed constraints in 197 ms returned sat
[2024-05-26 19:27:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:27:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 54 ms returned sat
[2024-05-26 19:27:55] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-26 19:27:56] [INFO ] [Nat]Absence check using state equation in 970 ms returned sat
[2024-05-26 19:27:56] [INFO ] [Nat]Added 330 Read/Feed constraints in 355 ms returned sat
[2024-05-26 19:27:56] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 160 ms.
[2024-05-26 19:27:59] [INFO ] Deduced a trap composed of 16 places in 1315 ms of which 11 ms to minimize.
[2024-05-26 19:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1712 ms
[2024-05-26 19:28:00] [INFO ] Added : 32 causal constraints over 9 iterations in 3900 ms. Result :sat
Minimization took 1778 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 1, 5] Max Struct:[6, 7, 7]
FORMULA Peterson-COL-6-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 5] Max Struct:[7, 7]
Support contains 301 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 1 with 504 rules applied. Total rules applied 756 place count 1078 transition count 1526
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 1008 place count 826 transition count 1526
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 1008 place count 826 transition count 1449
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 1162 place count 749 transition count 1449
Applied a total of 1162 rules in 246 ms. Remains 749 /1330 variables (removed 581) and now considering 1449/2030 (removed 581) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 749/1330 places, 1449/2030 transitions.
[2024-05-26 19:28:03] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
// Phase 1: matrix 1239 rows 749 cols
[2024-05-26 19:28:03] [INFO ] Computed 27 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 5] Max Struct:[7, 7]
RANDOM walk for 1000000 steps (2 resets) in 7243 ms. (138 steps per ms)
BEST_FIRST walk for 1860555 steps (4 resets) in 6324 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 6] Max Struct:[7, 7]
[2024-05-26 19:28:17] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:28:17] [INFO ] Invariant cache hit.
[2024-05-26 19:28:17] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2024-05-26 19:28:17] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-26 19:28:18] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2024-05-26 19:28:18] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:28:18] [INFO ] [Real]Added 330 Read/Feed constraints in 97 ms returned sat
[2024-05-26 19:28:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:28:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 32 ms returned sat
[2024-05-26 19:28:18] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-26 19:28:19] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2024-05-26 19:28:19] [INFO ] [Nat]Added 330 Read/Feed constraints in 261 ms returned sat
[2024-05-26 19:28:20] [INFO ] Deduced a trap composed of 27 places in 558 ms of which 10 ms to minimize.
[2024-05-26 19:28:20] [INFO ] Deduced a trap composed of 31 places in 710 ms of which 8 ms to minimize.
[2024-05-26 19:28:21] [INFO ] Deduced a trap composed of 53 places in 714 ms of which 9 ms to minimize.
[2024-05-26 19:28:22] [INFO ] Deduced a trap composed of 59 places in 764 ms of which 9 ms to minimize.
[2024-05-26 19:28:23] [INFO ] Deduced a trap composed of 40 places in 744 ms of which 10 ms to minimize.
[2024-05-26 19:28:24] [INFO ] Deduced a trap composed of 26 places in 741 ms of which 10 ms to minimize.
[2024-05-26 19:28:24] [INFO ] Deduced a trap composed of 105 places in 722 ms of which 9 ms to minimize.
[2024-05-26 19:28:25] [INFO ] Deduced a trap composed of 61 places in 728 ms of which 9 ms to minimize.
[2024-05-26 19:28:26] [INFO ] Deduced a trap composed of 51 places in 733 ms of which 9 ms to minimize.
[2024-05-26 19:28:27] [INFO ] Deduced a trap composed of 76 places in 752 ms of which 10 ms to minimize.
[2024-05-26 19:28:28] [INFO ] Deduced a trap composed of 55 places in 736 ms of which 10 ms to minimize.
[2024-05-26 19:28:29] [INFO ] Deduced a trap composed of 14 places in 766 ms of which 10 ms to minimize.
[2024-05-26 19:28:30] [INFO ] Deduced a trap composed of 51 places in 757 ms of which 10 ms to minimize.
[2024-05-26 19:28:30] [INFO ] Deduced a trap composed of 21 places in 736 ms of which 9 ms to minimize.
[2024-05-26 19:28:31] [INFO ] Deduced a trap composed of 32 places in 704 ms of which 10 ms to minimize.
[2024-05-26 19:28:32] [INFO ] Deduced a trap composed of 38 places in 709 ms of which 9 ms to minimize.
[2024-05-26 19:28:33] [INFO ] Deduced a trap composed of 32 places in 699 ms of which 10 ms to minimize.
[2024-05-26 19:28:34] [INFO ] Deduced a trap composed of 22 places in 693 ms of which 10 ms to minimize.
[2024-05-26 19:28:34] [INFO ] Deduced a trap composed of 32 places in 726 ms of which 10 ms to minimize.
[2024-05-26 19:28:35] [INFO ] Deduced a trap composed of 38 places in 726 ms of which 9 ms to minimize.
[2024-05-26 19:28:36] [INFO ] Deduced a trap composed of 24 places in 727 ms of which 9 ms to minimize.
[2024-05-26 19:28:38] [INFO ] Deduced a trap composed of 14 places in 574 ms of which 11 ms to minimize.
[2024-05-26 19:28:39] [INFO ] Deduced a trap composed of 56 places in 742 ms of which 9 ms to minimize.
[2024-05-26 19:28:39] [INFO ] Deduced a trap composed of 92 places in 724 ms of which 10 ms to minimize.
[2024-05-26 19:28:40] [INFO ] Deduced a trap composed of 76 places in 724 ms of which 10 ms to minimize.
[2024-05-26 19:28:41] [INFO ] Deduced a trap composed of 20 places in 714 ms of which 9 ms to minimize.
[2024-05-26 19:28:42] [INFO ] Deduced a trap composed of 108 places in 712 ms of which 10 ms to minimize.
[2024-05-26 19:28:43] [INFO ] Deduced a trap composed of 36 places in 713 ms of which 9 ms to minimize.
[2024-05-26 19:28:43] [INFO ] Deduced a trap composed of 30 places in 717 ms of which 9 ms to minimize.
[2024-05-26 19:28:44] [INFO ] Deduced a trap composed of 74 places in 736 ms of which 10 ms to minimize.
[2024-05-26 19:28:45] [INFO ] Deduced a trap composed of 56 places in 742 ms of which 10 ms to minimize.
[2024-05-26 19:28:46] [INFO ] Deduced a trap composed of 22 places in 734 ms of which 9 ms to minimize.
[2024-05-26 19:28:47] [INFO ] Deduced a trap composed of 47 places in 717 ms of which 9 ms to minimize.
[2024-05-26 19:28:48] [INFO ] Deduced a trap composed of 100 places in 763 ms of which 9 ms to minimize.
[2024-05-26 19:28:49] [INFO ] Deduced a trap composed of 62 places in 747 ms of which 9 ms to minimize.
[2024-05-26 19:28:50] [INFO ] Deduced a trap composed of 100 places in 707 ms of which 9 ms to minimize.
[2024-05-26 19:28:50] [INFO ] Deduced a trap composed of 81 places in 757 ms of which 10 ms to minimize.
[2024-05-26 19:28:51] [INFO ] Deduced a trap composed of 28 places in 599 ms of which 9 ms to minimize.
[2024-05-26 19:28:52] [INFO ] Deduced a trap composed of 68 places in 689 ms of which 8 ms to minimize.
[2024-05-26 19:28:53] [INFO ] Deduced a trap composed of 98 places in 620 ms of which 10 ms to minimize.
[2024-05-26 19:28:54] [INFO ] Deduced a trap composed of 42 places in 741 ms of which 9 ms to minimize.
[2024-05-26 19:28:55] [INFO ] Deduced a trap composed of 116 places in 758 ms of which 9 ms to minimize.
[2024-05-26 19:28:56] [INFO ] Deduced a trap composed of 78 places in 736 ms of which 9 ms to minimize.
[2024-05-26 19:28:57] [INFO ] Deduced a trap composed of 28 places in 755 ms of which 9 ms to minimize.
[2024-05-26 19:28:58] [INFO ] Deduced a trap composed of 100 places in 699 ms of which 9 ms to minimize.
[2024-05-26 19:29:02] [INFO ] Deduced a trap composed of 58 places in 513 ms of which 10 ms to minimize.
[2024-05-26 19:29:03] [INFO ] Deduced a trap composed of 22 places in 670 ms of which 9 ms to minimize.
[2024-05-26 19:29:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-26 19:29:04] [INFO ] [Real]Absence check using 20 positive place invariants in 34 ms returned sat
[2024-05-26 19:29:04] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-26 19:29:04] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2024-05-26 19:29:04] [INFO ] [Real]Added 330 Read/Feed constraints in 110 ms returned sat
[2024-05-26 19:29:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:29:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2024-05-26 19:29:05] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-26 19:29:05] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2024-05-26 19:29:06] [INFO ] [Nat]Added 330 Read/Feed constraints in 124 ms returned sat
[2024-05-26 19:29:06] [INFO ] Computed and/alt/rep : 1148/3171/1148 causal constraints (skipped 84 transitions) in 103 ms.
[2024-05-26 19:29:12] [INFO ] Deduced a trap composed of 115 places in 955 ms of which 11 ms to minimize.
[2024-05-26 19:29:13] [INFO ] Deduced a trap composed of 73 places in 922 ms of which 11 ms to minimize.
[2024-05-26 19:29:14] [INFO ] Deduced a trap composed of 72 places in 929 ms of which 11 ms to minimize.
[2024-05-26 19:29:15] [INFO ] Deduced a trap composed of 18 places in 1022 ms of which 11 ms to minimize.
[2024-05-26 19:29:16] [INFO ] Deduced a trap composed of 55 places in 885 ms of which 11 ms to minimize.
[2024-05-26 19:29:17] [INFO ] Deduced a trap composed of 68 places in 881 ms of which 11 ms to minimize.
[2024-05-26 19:29:18] [INFO ] Deduced a trap composed of 67 places in 863 ms of which 11 ms to minimize.
[2024-05-26 19:29:19] [INFO ] Deduced a trap composed of 69 places in 920 ms of which 11 ms to minimize.
[2024-05-26 19:29:20] [INFO ] Deduced a trap composed of 106 places in 880 ms of which 11 ms to minimize.
[2024-05-26 19:29:21] [INFO ] Deduced a trap composed of 186 places in 634 ms of which 11 ms to minimize.
[2024-05-26 19:29:22] [INFO ] Deduced a trap composed of 126 places in 892 ms of which 11 ms to minimize.
[2024-05-26 19:29:23] [INFO ] Deduced a trap composed of 22 places in 855 ms of which 11 ms to minimize.
[2024-05-26 19:29:25] [INFO ] Deduced a trap composed of 74 places in 895 ms of which 11 ms to minimize.
[2024-05-26 19:29:26] [INFO ] Deduced a trap composed of 30 places in 941 ms of which 10 ms to minimize.
[2024-05-26 19:29:27] [INFO ] Deduced a trap composed of 35 places in 904 ms of which 11 ms to minimize.
[2024-05-26 19:29:28] [INFO ] Deduced a trap composed of 88 places in 920 ms of which 12 ms to minimize.
[2024-05-26 19:29:29] [INFO ] Deduced a trap composed of 48 places in 914 ms of which 11 ms to minimize.
[2024-05-26 19:29:30] [INFO ] Deduced a trap composed of 83 places in 889 ms of which 11 ms to minimize.
[2024-05-26 19:29:32] [INFO ] Deduced a trap composed of 59 places in 887 ms of which 10 ms to minimize.
[2024-05-26 19:29:33] [INFO ] Deduced a trap composed of 143 places in 872 ms of which 11 ms to minimize.
[2024-05-26 19:29:34] [INFO ] Deduced a trap composed of 43 places in 886 ms of which 11 ms to minimize.
[2024-05-26 19:29:35] [INFO ] Deduced a trap composed of 47 places in 921 ms of which 11 ms to minimize.
[2024-05-26 19:29:37] [INFO ] Deduced a trap composed of 49 places in 870 ms of which 11 ms to minimize.
[2024-05-26 19:29:38] [INFO ] Deduced a trap composed of 61 places in 863 ms of which 11 ms to minimize.
[2024-05-26 19:29:39] [INFO ] Deduced a trap composed of 87 places in 875 ms of which 10 ms to minimize.
[2024-05-26 19:29:43] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 32477 ms
Maximisation of solution failed !
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 6] Max Struct:[7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 6] Max Struct:[7, 7]
Support contains 301 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 1449/1449 transitions.
Applied a total of 0 rules in 56 ms. Remains 749 /749 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 749/749 places, 1449/1449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 1449/1449 transitions.
Applied a total of 0 rules in 57 ms. Remains 749 /749 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
[2024-05-26 19:29:50] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:29:50] [INFO ] Invariant cache hit.
[2024-05-26 19:29:51] [INFO ] Implicit Places using invariants in 879 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 888 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 742/749 places, 1449/1449 transitions.
Applied a total of 0 rules in 54 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1007 ms. Remains : 742/749 places, 1449/1449 transitions.
[2024-05-26 19:29:51] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
// Phase 1: matrix 1239 rows 742 cols
[2024-05-26 19:29:51] [INFO ] Computed 20 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 6] Max Struct:[7, 7]
RANDOM walk for 1000000 steps (2 resets) in 8316 ms. (120 steps per ms)
BEST_FIRST walk for 1873427 steps (4 resets) in 6637 ms. (282 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 6] Max Struct:[7, 7]
[2024-05-26 19:30:06] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:30:06] [INFO ] Invariant cache hit.
[2024-05-26 19:30:06] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2024-05-26 19:30:06] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2024-05-26 19:30:06] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:30:06] [INFO ] [Real]Added 330 Read/Feed constraints in 63 ms returned sat
[2024-05-26 19:30:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:30:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2024-05-26 19:30:07] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2024-05-26 19:30:08] [INFO ] [Nat]Added 330 Read/Feed constraints in 256 ms returned sat
[2024-05-26 19:30:08] [INFO ] Deduced a trap composed of 66 places in 555 ms of which 9 ms to minimize.
[2024-05-26 19:30:09] [INFO ] Deduced a trap composed of 12 places in 738 ms of which 9 ms to minimize.
[2024-05-26 19:30:10] [INFO ] Deduced a trap composed of 14 places in 737 ms of which 9 ms to minimize.
[2024-05-26 19:30:11] [INFO ] Deduced a trap composed of 28 places in 710 ms of which 9 ms to minimize.
[2024-05-26 19:30:11] [INFO ] Deduced a trap composed of 14 places in 706 ms of which 9 ms to minimize.
[2024-05-26 19:30:12] [INFO ] Deduced a trap composed of 60 places in 600 ms of which 9 ms to minimize.
[2024-05-26 19:30:13] [INFO ] Deduced a trap composed of 22 places in 768 ms of which 10 ms to minimize.
[2024-05-26 19:30:14] [INFO ] Deduced a trap composed of 44 places in 787 ms of which 10 ms to minimize.
[2024-05-26 19:30:15] [INFO ] Deduced a trap composed of 43 places in 767 ms of which 9 ms to minimize.
[2024-05-26 19:30:16] [INFO ] Deduced a trap composed of 34 places in 759 ms of which 10 ms to minimize.
[2024-05-26 19:30:16] [INFO ] Deduced a trap composed of 28 places in 752 ms of which 10 ms to minimize.
[2024-05-26 19:30:17] [INFO ] Deduced a trap composed of 28 places in 658 ms of which 9 ms to minimize.
[2024-05-26 19:30:18] [INFO ] Deduced a trap composed of 64 places in 748 ms of which 10 ms to minimize.
[2024-05-26 19:30:19] [INFO ] Deduced a trap composed of 22 places in 745 ms of which 9 ms to minimize.
[2024-05-26 19:30:20] [INFO ] Deduced a trap composed of 14 places in 713 ms of which 10 ms to minimize.
[2024-05-26 19:30:21] [INFO ] Deduced a trap composed of 44 places in 726 ms of which 9 ms to minimize.
[2024-05-26 19:30:22] [INFO ] Deduced a trap composed of 81 places in 723 ms of which 10 ms to minimize.
[2024-05-26 19:30:22] [INFO ] Deduced a trap composed of 45 places in 691 ms of which 9 ms to minimize.
[2024-05-26 19:30:23] [INFO ] Deduced a trap composed of 28 places in 745 ms of which 8 ms to minimize.
[2024-05-26 19:30:24] [INFO ] Deduced a trap composed of 100 places in 722 ms of which 9 ms to minimize.
[2024-05-26 19:30:25] [INFO ] Deduced a trap composed of 63 places in 711 ms of which 9 ms to minimize.
[2024-05-26 19:30:25] [INFO ] Deduced a trap composed of 38 places in 677 ms of which 8 ms to minimize.
[2024-05-26 19:30:26] [INFO ] Deduced a trap composed of 71 places in 625 ms of which 10 ms to minimize.
[2024-05-26 19:30:27] [INFO ] Deduced a trap composed of 74 places in 688 ms of which 10 ms to minimize.
[2024-05-26 19:30:28] [INFO ] Deduced a trap composed of 26 places in 676 ms of which 9 ms to minimize.
[2024-05-26 19:30:29] [INFO ] Deduced a trap composed of 83 places in 712 ms of which 10 ms to minimize.
[2024-05-26 19:30:30] [INFO ] Deduced a trap composed of 14 places in 717 ms of which 9 ms to minimize.
[2024-05-26 19:30:30] [INFO ] Deduced a trap composed of 48 places in 735 ms of which 9 ms to minimize.
[2024-05-26 19:30:31] [INFO ] Deduced a trap composed of 59 places in 714 ms of which 9 ms to minimize.
[2024-05-26 19:30:32] [INFO ] Deduced a trap composed of 80 places in 750 ms of which 10 ms to minimize.
[2024-05-26 19:30:33] [INFO ] Deduced a trap composed of 30 places in 721 ms of which 10 ms to minimize.
[2024-05-26 19:30:34] [INFO ] Deduced a trap composed of 85 places in 733 ms of which 9 ms to minimize.
[2024-05-26 19:30:34] [INFO ] Deduced a trap composed of 64 places in 718 ms of which 9 ms to minimize.
[2024-05-26 19:30:35] [INFO ] Deduced a trap composed of 30 places in 617 ms of which 9 ms to minimize.
[2024-05-26 19:30:36] [INFO ] Deduced a trap composed of 51 places in 766 ms of which 9 ms to minimize.
[2024-05-26 19:30:37] [INFO ] Deduced a trap composed of 16 places in 740 ms of which 9 ms to minimize.
[2024-05-26 19:30:38] [INFO ] Deduced a trap composed of 32 places in 711 ms of which 9 ms to minimize.
[2024-05-26 19:30:39] [INFO ] Deduced a trap composed of 42 places in 708 ms of which 9 ms to minimize.
[2024-05-26 19:30:39] [INFO ] Deduced a trap composed of 61 places in 518 ms of which 7 ms to minimize.
[2024-05-26 19:30:40] [INFO ] Deduced a trap composed of 112 places in 684 ms of which 9 ms to minimize.
[2024-05-26 19:30:41] [INFO ] Deduced a trap composed of 74 places in 720 ms of which 9 ms to minimize.
[2024-05-26 19:30:41] [INFO ] Deduced a trap composed of 48 places in 726 ms of which 10 ms to minimize.
[2024-05-26 19:30:43] [INFO ] Deduced a trap composed of 94 places in 751 ms of which 9 ms to minimize.
[2024-05-26 19:30:43] [INFO ] Deduced a trap composed of 16 places in 682 ms of which 9 ms to minimize.
[2024-05-26 19:30:44] [INFO ] Deduced a trap composed of 56 places in 621 ms of which 7 ms to minimize.
[2024-05-26 19:30:45] [INFO ] Deduced a trap composed of 86 places in 650 ms of which 9 ms to minimize.
[2024-05-26 19:30:45] [INFO ] Deduced a trap composed of 97 places in 732 ms of which 9 ms to minimize.
[2024-05-26 19:30:47] [INFO ] Deduced a trap composed of 102 places in 717 ms of which 9 ms to minimize.
[2024-05-26 19:30:48] [INFO ] Deduced a trap composed of 43 places in 747 ms of which 10 ms to minimize.
[2024-05-26 19:30:48] [INFO ] Deduced a trap composed of 46 places in 462 ms of which 6 ms to minimize.
[2024-05-26 19:30:50] [INFO ] Deduced a trap composed of 73 places in 639 ms of which 8 ms to minimize.
[2024-05-26 19:30:51] [INFO ] Deduced a trap composed of 105 places in 719 ms of which 10 ms to minimize.
[2024-05-26 19:30:51] [INFO ] Deduced a trap composed of 109 places in 712 ms of which 9 ms to minimize.
[2024-05-26 19:30:52] [INFO ] Trap strengthening (SAT) tested/added 53/53 trap constraints in 43989 ms
[2024-05-26 19:30:52] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2024-05-26 19:30:52] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2024-05-26 19:30:53] [INFO ] [Real]Added 330 Read/Feed constraints in 70 ms returned sat
[2024-05-26 19:30:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:30:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2024-05-26 19:30:53] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2024-05-26 19:30:54] [INFO ] [Nat]Added 330 Read/Feed constraints in 145 ms returned sat
[2024-05-26 19:30:54] [INFO ] Deduced a trap composed of 12 places in 701 ms of which 10 ms to minimize.
[2024-05-26 19:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 830 ms
[2024-05-26 19:30:55] [INFO ] Computed and/alt/rep : 1148/3171/1148 causal constraints (skipped 84 transitions) in 162 ms.
[2024-05-26 19:30:59] [INFO ] Deduced a trap composed of 48 places in 822 ms of which 10 ms to minimize.
[2024-05-26 19:31:00] [INFO ] Deduced a trap composed of 32 places in 811 ms of which 10 ms to minimize.
[2024-05-26 19:31:01] [INFO ] Deduced a trap composed of 44 places in 904 ms of which 11 ms to minimize.
[2024-05-26 19:31:02] [INFO ] Deduced a trap composed of 45 places in 923 ms of which 10 ms to minimize.
[2024-05-26 19:31:03] [INFO ] Deduced a trap composed of 30 places in 856 ms of which 10 ms to minimize.
[2024-05-26 19:31:05] [INFO ] Deduced a trap composed of 71 places in 842 ms of which 10 ms to minimize.
[2024-05-26 19:31:06] [INFO ] Deduced a trap composed of 10 places in 793 ms of which 9 ms to minimize.
[2024-05-26 19:31:06] [INFO ] Deduced a trap composed of 30 places in 831 ms of which 11 ms to minimize.
[2024-05-26 19:31:07] [INFO ] Deduced a trap composed of 22 places in 845 ms of which 10 ms to minimize.
[2024-05-26 19:31:08] [INFO ] Deduced a trap composed of 36 places in 737 ms of which 10 ms to minimize.
[2024-05-26 19:31:09] [INFO ] Deduced a trap composed of 22 places in 809 ms of which 11 ms to minimize.
[2024-05-26 19:31:10] [INFO ] Deduced a trap composed of 26 places in 837 ms of which 11 ms to minimize.
[2024-05-26 19:31:11] [INFO ] Deduced a trap composed of 14 places in 869 ms of which 11 ms to minimize.
[2024-05-26 19:31:12] [INFO ] Deduced a trap composed of 58 places in 686 ms of which 10 ms to minimize.
[2024-05-26 19:31:13] [INFO ] Deduced a trap composed of 36 places in 788 ms of which 9 ms to minimize.
[2024-05-26 19:31:13] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 15090 ms
[2024-05-26 19:31:14] [INFO ] Added : 165 causal constraints over 34 iterations in 19333 ms. Result :sat
Minimization took 876 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 6] Max Struct:[7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 6] Max Struct:[7, 7]
Support contains 301 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 38 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 742/742 places, 1449/1449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 24 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
[2024-05-26 19:31:16] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:31:16] [INFO ] Invariant cache hit.
[2024-05-26 19:31:16] [INFO ] Implicit Places using invariants in 582 ms returned []
[2024-05-26 19:31:16] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:31:16] [INFO ] Invariant cache hit.
[2024-05-26 19:31:17] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:31:20] [INFO ] Implicit Places using invariants and state equation in 3789 ms returned []
Implicit Place search using SMT with State Equation took 4372 ms to find 0 implicit places.
[2024-05-26 19:31:20] [INFO ] Redundant transitions in 153 ms returned []
Running 1442 sub problems to find dead transitions.
[2024-05-26 19:31:20] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:31:20] [INFO ] Invariant cache hit.
[2024-05-26 19:31:21] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/1981 variables, and 20 constraints, problems are : Problem set: 0 solved, 1442 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/742 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1442/1442 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2024-05-26 19:31:54] [INFO ] Deduced a trap composed of 16 places in 523 ms of which 7 ms to minimize.
[2024-05-26 19:31:54] [INFO ] Deduced a trap composed of 36 places in 570 ms of which 8 ms to minimize.
[2024-05-26 19:31:55] [INFO ] Deduced a trap composed of 33 places in 769 ms of which 10 ms to minimize.
[2024-05-26 19:31:56] [INFO ] Deduced a trap composed of 52 places in 722 ms of which 9 ms to minimize.
[2024-05-26 19:31:57] [INFO ] Deduced a trap composed of 62 places in 703 ms of which 9 ms to minimize.
[2024-05-26 19:31:57] [INFO ] Deduced a trap composed of 60 places in 566 ms of which 6 ms to minimize.
[2024-05-26 19:31:58] [INFO ] Deduced a trap composed of 82 places in 636 ms of which 9 ms to minimize.
[2024-05-26 19:31:59] [INFO ] Deduced a trap composed of 46 places in 634 ms of which 6 ms to minimize.
[2024-05-26 19:31:59] [INFO ] Deduced a trap composed of 123 places in 381 ms of which 5 ms to minimize.
[2024-05-26 19:31:59] [INFO ] Deduced a trap composed of 49 places in 487 ms of which 10 ms to minimize.
[2024-05-26 19:32:00] [INFO ] Deduced a trap composed of 61 places in 635 ms of which 8 ms to minimize.
[2024-05-26 19:32:01] [INFO ] Deduced a trap composed of 28 places in 666 ms of which 9 ms to minimize.
[2024-05-26 19:32:02] [INFO ] Deduced a trap composed of 37 places in 795 ms of which 9 ms to minimize.
[2024-05-26 19:32:02] [INFO ] Deduced a trap composed of 57 places in 790 ms of which 10 ms to minimize.
[2024-05-26 19:32:03] [INFO ] Deduced a trap composed of 39 places in 791 ms of which 10 ms to minimize.
[2024-05-26 19:32:04] [INFO ] Deduced a trap composed of 57 places in 810 ms of which 10 ms to minimize.
[2024-05-26 19:32:05] [INFO ] Deduced a trap composed of 51 places in 803 ms of which 11 ms to minimize.
[2024-05-26 19:32:06] [INFO ] Deduced a trap composed of 16 places in 728 ms of which 9 ms to minimize.
[2024-05-26 19:32:06] [INFO ] Deduced a trap composed of 16 places in 807 ms of which 10 ms to minimize.
[2024-05-26 19:32:07] [INFO ] Deduced a trap composed of 16 places in 750 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/742 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2024-05-26 19:32:08] [INFO ] Deduced a trap composed of 26 places in 481 ms of which 6 ms to minimize.
[2024-05-26 19:32:09] [INFO ] Deduced a trap composed of 26 places in 715 ms of which 9 ms to minimize.
[2024-05-26 19:32:10] [INFO ] Deduced a trap composed of 26 places in 459 ms of which 8 ms to minimize.
[2024-05-26 19:32:10] [INFO ] Deduced a trap composed of 26 places in 568 ms of which 8 ms to minimize.
[2024-05-26 19:32:11] [INFO ] Deduced a trap composed of 26 places in 574 ms of which 8 ms to minimize.
[2024-05-26 19:32:11] [INFO ] Deduced a trap composed of 62 places in 606 ms of which 8 ms to minimize.
[2024-05-26 19:32:12] [INFO ] Deduced a trap composed of 26 places in 745 ms of which 10 ms to minimize.
[2024-05-26 19:32:13] [INFO ] Deduced a trap composed of 22 places in 752 ms of which 9 ms to minimize.
[2024-05-26 19:32:14] [INFO ] Deduced a trap composed of 44 places in 724 ms of which 9 ms to minimize.
[2024-05-26 19:32:14] [INFO ] Deduced a trap composed of 26 places in 745 ms of which 9 ms to minimize.
[2024-05-26 19:32:15] [INFO ] Deduced a trap composed of 37 places in 711 ms of which 9 ms to minimize.
[2024-05-26 19:32:16] [INFO ] Deduced a trap composed of 12 places in 757 ms of which 10 ms to minimize.
[2024-05-26 19:32:17] [INFO ] Deduced a trap composed of 26 places in 736 ms of which 10 ms to minimize.
[2024-05-26 19:32:17] [INFO ] Deduced a trap composed of 14 places in 734 ms of which 9 ms to minimize.
[2024-05-26 19:32:18] [INFO ] Deduced a trap composed of 96 places in 530 ms of which 7 ms to minimize.
[2024-05-26 19:32:19] [INFO ] Deduced a trap composed of 36 places in 604 ms of which 8 ms to minimize.
[2024-05-26 19:32:19] [INFO ] Deduced a trap composed of 22 places in 616 ms of which 8 ms to minimize.
[2024-05-26 19:32:20] [INFO ] Deduced a trap composed of 38 places in 599 ms of which 7 ms to minimize.
[2024-05-26 19:32:21] [INFO ] Deduced a trap composed of 60 places in 578 ms of which 8 ms to minimize.
[2024-05-26 19:32:21] [INFO ] Deduced a trap composed of 34 places in 603 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/742 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 742/1981 variables, and 60 constraints, problems are : Problem set: 0 solved, 1442 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/742 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1442 constraints, Known Traps: 40/40 constraints]
After SMT, in 61123ms problems are : Problem set: 0 solved, 1442 unsolved
Search for dead transitions found 0 dead transitions in 61177ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65756 ms. Remains : 742/742 places, 1449/1449 transitions.
RANDOM walk for 40000 steps (8 resets) in 1935 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
[2024-05-26 19:32:22] [INFO ] Flatten gal took : 357 ms
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 503 ms. (79 steps per ms) remains 4/4 properties
[2024-05-26 19:32:23] [INFO ] Flatten gal took : 301 ms
BEST_FIRST walk for 40004 steps (8 resets) in 581 ms. (68 steps per ms) remains 4/4 properties
[2024-05-26 19:32:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5092014306643135885.gal : 83 ms
[2024-05-26 19:32:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6904400809636124492.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5092014306643135885.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6904400809636124492.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6904400809636124492.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :10 after 11
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :11 after 17
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :17 after 43
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :43 after 60
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :60 after 203
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :203 after 618
Interrupted probabilistic random walk after 166480 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 4
Probabilistic random walk after 166480 steps, saw 37921 distinct states, run finished after 3006 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-26 19:32:26] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:32:26] [INFO ] Invariant cache hit.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :618 after 860
[2024-05-26 19:32:26] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 19:32:27] [INFO ] Deduced a trap composed of 66 places in 437 ms of which 7 ms to minimize.
[2024-05-26 19:32:27] [INFO ] Deduced a trap composed of 177 places in 228 ms of which 4 ms to minimize.
[2024-05-26 19:32:27] [INFO ] Deduced a trap composed of 171 places in 123 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 19:32:28] [INFO ] Deduced a trap composed of 102 places in 407 ms of which 7 ms to minimize.
[2024-05-26 19:32:28] [INFO ] Deduced a trap composed of 78 places in 416 ms of which 7 ms to minimize.
[2024-05-26 19:32:28] [INFO ] Deduced a trap composed of 54 places in 411 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/700 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1239/1939 variables, 700/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 330/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :860 after 5212
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 42/1981 variables, 42/1092 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1981 variables, 6/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1981 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1981 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1098 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4388 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 742/742 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/700 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1239/1939 variables, 700/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1939 variables, 330/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 4/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 42/1981 variables, 42/1096 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1981 variables, 6/1102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :5212 after 11994
[2024-05-26 19:32:35] [INFO ] Deduced a trap composed of 32 places in 462 ms of which 6 ms to minimize.
[2024-05-26 19:32:35] [INFO ] Deduced a trap composed of 83 places in 467 ms of which 6 ms to minimize.
SMT process timed out in 9829ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 301 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 44 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 742/742 places, 1449/1449 transitions.
RANDOM walk for 40000 steps (8 resets) in 1365 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 645 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 626 ms. (63 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 172432 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 4
Probabilistic random walk after 172432 steps, saw 38750 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-26 19:32:39] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:32:39] [INFO ] Invariant cache hit.
[2024-05-26 19:32:39] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 19:32:40] [INFO ] Deduced a trap composed of 66 places in 478 ms of which 7 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :11994 after 24068
[2024-05-26 19:32:41] [INFO ] Deduced a trap composed of 177 places in 163 ms of which 4 ms to minimize.
[2024-05-26 19:32:41] [INFO ] Deduced a trap composed of 171 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 19:32:41] [INFO ] Deduced a trap composed of 102 places in 399 ms of which 7 ms to minimize.
[2024-05-26 19:32:42] [INFO ] Deduced a trap composed of 78 places in 405 ms of which 7 ms to minimize.
[2024-05-26 19:32:42] [INFO ] Deduced a trap composed of 54 places in 389 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/700 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1239/1939 variables, 700/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 330/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 42/1981 variables, 42/1092 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1981 variables, 6/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1981 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1981 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1098 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4171 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 742/742 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/700 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1239/1939 variables, 700/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1939 variables, 330/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 4/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 42/1981 variables, 42/1096 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1981 variables, 6/1102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 19:32:48] [INFO ] Deduced a trap composed of 32 places in 462 ms of which 6 ms to minimize.
[2024-05-26 19:32:49] [INFO ] Deduced a trap composed of 83 places in 463 ms of which 6 ms to minimize.
[2024-05-26 19:32:49] [INFO ] Deduced a trap composed of 78 places in 479 ms of which 6 ms to minimize.
[2024-05-26 19:32:50] [INFO ] Deduced a trap composed of 78 places in 482 ms of which 6 ms to minimize.
[2024-05-26 19:32:50] [INFO ] Deduced a trap composed of 120 places in 474 ms of which 6 ms to minimize.
[2024-05-26 19:32:51] [INFO ] Deduced a trap composed of 55 places in 468 ms of which 6 ms to minimize.
[2024-05-26 19:32:52] [INFO ] Deduced a trap composed of 53 places in 482 ms of which 6 ms to minimize.
[2024-05-26 19:32:52] [INFO ] Deduced a trap composed of 64 places in 505 ms of which 6 ms to minimize.
[2024-05-26 19:32:53] [INFO ] Deduced a trap composed of 46 places in 499 ms of which 6 ms to minimize.
[2024-05-26 19:32:53] [INFO ] Deduced a trap composed of 43 places in 499 ms of which 6 ms to minimize.
[2024-05-26 19:32:54] [INFO ] Deduced a trap composed of 54 places in 493 ms of which 6 ms to minimize.
[2024-05-26 19:32:54] [INFO ] Deduced a trap composed of 86 places in 639 ms of which 7 ms to minimize.
[2024-05-26 19:32:55] [INFO ] Deduced a trap composed of 38 places in 494 ms of which 8 ms to minimize.
[2024-05-26 19:32:55] [INFO ] Deduced a trap composed of 46 places in 488 ms of which 9 ms to minimize.
[2024-05-26 19:32:56] [INFO ] Deduced a trap composed of 38 places in 463 ms of which 6 ms to minimize.
[2024-05-26 19:32:56] [INFO ] Deduced a trap composed of 138 places in 461 ms of which 6 ms to minimize.
[2024-05-26 19:32:57] [INFO ] Deduced a trap composed of 32 places in 467 ms of which 6 ms to minimize.
[2024-05-26 19:32:58] [INFO ] Deduced a trap composed of 50 places in 461 ms of which 6 ms to minimize.
[2024-05-26 19:32:58] [INFO ] Deduced a trap composed of 60 places in 470 ms of which 6 ms to minimize.
[2024-05-26 19:32:59] [INFO ] Deduced a trap composed of 38 places in 467 ms of which 6 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/1981 variables, 20/1122 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-26 19:33:00] [INFO ] Deduced a trap composed of 51 places in 515 ms of which 6 ms to minimize.
[2024-05-26 19:33:01] [INFO ] Deduced a trap composed of 48 places in 554 ms of which 9 ms to minimize.
[2024-05-26 19:33:01] [INFO ] Deduced a trap composed of 87 places in 513 ms of which 6 ms to minimize.
[2024-05-26 19:33:02] [INFO ] Deduced a trap composed of 76 places in 548 ms of which 7 ms to minimize.
[2024-05-26 19:33:02] [INFO ] Deduced a trap composed of 68 places in 512 ms of which 7 ms to minimize.
[2024-05-26 19:33:03] [INFO ] Deduced a trap composed of 14 places in 519 ms of which 7 ms to minimize.
[2024-05-26 19:33:04] [INFO ] Deduced a trap composed of 22 places in 514 ms of which 7 ms to minimize.
[2024-05-26 19:33:04] [INFO ] Deduced a trap composed of 22 places in 517 ms of which 7 ms to minimize.
[2024-05-26 19:33:05] [INFO ] Deduced a trap composed of 64 places in 510 ms of which 6 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :24068 after 130496
[2024-05-26 19:33:05] [INFO ] Deduced a trap composed of 37 places in 519 ms of which 7 ms to minimize.
[2024-05-26 19:33:06] [INFO ] Deduced a trap composed of 37 places in 523 ms of which 6 ms to minimize.
[2024-05-26 19:33:06] [INFO ] Deduced a trap composed of 47 places in 520 ms of which 6 ms to minimize.
[2024-05-26 19:33:07] [INFO ] Deduced a trap composed of 48 places in 520 ms of which 6 ms to minimize.
[2024-05-26 19:33:08] [INFO ] Deduced a trap composed of 45 places in 512 ms of which 6 ms to minimize.
[2024-05-26 19:33:08] [INFO ] Deduced a trap composed of 37 places in 525 ms of which 6 ms to minimize.
[2024-05-26 19:33:09] [INFO ] Deduced a trap composed of 79 places in 520 ms of which 6 ms to minimize.
[2024-05-26 19:33:09] [INFO ] Deduced a trap composed of 70 places in 521 ms of which 7 ms to minimize.
[2024-05-26 19:33:10] [INFO ] Deduced a trap composed of 86 places in 539 ms of which 6 ms to minimize.
[2024-05-26 19:33:10] [INFO ] Deduced a trap composed of 74 places in 533 ms of which 6 ms to minimize.
[2024-05-26 19:33:11] [INFO ] Deduced a trap composed of 55 places in 537 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1981 variables, 20/1142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Detected timeout of ITS tools.
[2024-05-26 19:33:13] [INFO ] Deduced a trap composed of 28 places in 459 ms of which 6 ms to minimize.
[2024-05-26 19:33:13] [INFO ] Flatten gal took : 104 ms
[2024-05-26 19:33:13] [INFO ] Applying decomposition
[2024-05-26 19:33:13] [INFO ] Flatten gal took : 91 ms
[2024-05-26 19:33:13] [INFO ] Deduced a trap composed of 30 places in 468 ms of which 6 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2198955553325532238.txt' '-o' '/tmp/graph2198955553325532238.bin' '-w' '/tmp/graph2198955553325532238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2198955553325532238.bin' '-l' '-1' '-v' '-w' '/tmp/graph2198955553325532238.weights' '-q' '0' '-e' '0.001'
[2024-05-26 19:33:14] [INFO ] Decomposing Gal with order
[2024-05-26 19:33:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 19:33:14] [INFO ] Deduced a trap composed of 32 places in 454 ms of which 7 ms to minimize.
[2024-05-26 19:33:14] [INFO ] Deduced a trap composed of 32 places in 465 ms of which 6 ms to minimize.
[2024-05-26 19:33:15] [INFO ] Deduced a trap composed of 76 places in 405 ms of which 6 ms to minimize.
[2024-05-26 19:33:15] [INFO ] Removed a total of 1574 redundant transitions.
[2024-05-26 19:33:15] [INFO ] Flatten gal took : 1136 ms
[2024-05-26 19:33:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 91 ms.
[2024-05-26 19:33:15] [INFO ] Deduced a trap composed of 135 places in 427 ms of which 6 ms to minimize.
[2024-05-26 19:33:16] [INFO ] Deduced a trap composed of 70 places in 406 ms of which 6 ms to minimize.
[2024-05-26 19:33:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1502275076397005795.gal : 67 ms
[2024-05-26 19:33:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9850300554999353329.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1502275076397005795.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9850300554999353329.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9850300554999353329.prop.
[2024-05-26 19:33:16] [INFO ] Deduced a trap composed of 79 places in 418 ms of which 6 ms to minimize.
[2024-05-26 19:33:17] [INFO ] Deduced a trap composed of 102 places in 450 ms of which 6 ms to minimize.
[2024-05-26 19:33:17] [INFO ] Deduced a trap composed of 22 places in 496 ms of which 6 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :13 after 14
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :14 after 16
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :16 after 29
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :29 after 30
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :30 after 62
[2024-05-26 19:33:18] [INFO ] Deduced a trap composed of 12 places in 422 ms of which 6 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :62 after 142
[2024-05-26 19:33:18] [INFO ] Deduced a trap composed of 63 places in 459 ms of which 6 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :142 after 1300
[2024-05-26 19:33:19] [INFO ] Deduced a trap composed of 42 places in 470 ms of which 6 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1300 after 2333
[2024-05-26 19:33:20] [INFO ] Deduced a trap composed of 12 places in 466 ms of which 6 ms to minimize.
[2024-05-26 19:33:20] [INFO ] Deduced a trap composed of 14 places in 473 ms of which 6 ms to minimize.
[2024-05-26 19:33:21] [INFO ] Deduced a trap composed of 26 places in 455 ms of which 6 ms to minimize.
[2024-05-26 19:33:21] [INFO ] Deduced a trap composed of 78 places in 465 ms of which 5 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :2333 after 6981
[2024-05-26 19:33:22] [INFO ] Deduced a trap composed of 38 places in 446 ms of which 6 ms to minimize.
[2024-05-26 19:33:22] [INFO ] Deduced a trap composed of 93 places in 426 ms of which 5 ms to minimize.
[2024-05-26 19:33:23] [INFO ] Deduced a trap composed of 16 places in 426 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1981 variables, 20/1162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-26 19:33:24] [INFO ] Deduced a trap composed of 71 places in 511 ms of which 6 ms to minimize.
[2024-05-26 19:33:25] [INFO ] Deduced a trap composed of 31 places in 513 ms of which 6 ms to minimize.
[2024-05-26 19:33:25] [INFO ] Deduced a trap composed of 73 places in 526 ms of which 6 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :6981 after 16607
[2024-05-26 19:33:26] [INFO ] Deduced a trap composed of 54 places in 526 ms of which 6 ms to minimize.
[2024-05-26 19:33:27] [INFO ] Deduced a trap composed of 54 places in 507 ms of which 6 ms to minimize.
[2024-05-26 19:33:27] [INFO ] Deduced a trap composed of 41 places in 509 ms of which 6 ms to minimize.
[2024-05-26 19:33:28] [INFO ] Deduced a trap composed of 63 places in 522 ms of which 6 ms to minimize.
[2024-05-26 19:33:28] [INFO ] Deduced a trap composed of 88 places in 541 ms of which 7 ms to minimize.
[2024-05-26 19:33:29] [INFO ] Deduced a trap composed of 26 places in 520 ms of which 8 ms to minimize.
SMT process timed out in 49332ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 428 ms.
Support contains 301 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 22 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 742/742 places, 1449/1449 transitions.
RANDOM walk for 40000 steps (8 resets) in 1418 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 431 ms. (92 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 3/3 properties
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :16607 after 61824
Interrupted probabilistic random walk after 260384 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 3
Probabilistic random walk after 260384 steps, saw 49653 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2024-05-26 19:33:33] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:33:33] [INFO ] Invariant cache hit.
[2024-05-26 19:33:33] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/700 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/700 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1239/1939 variables, 700/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1939 variables, 330/1044 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1939 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 42/1981 variables, 42/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1981 variables, 6/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1981 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1981 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1092 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 742/742 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 19:33:35] [INFO ] Deduced a trap composed of 54 places in 320 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/700 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1239/1939 variables, 700/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1939 variables, 330/1045 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 3/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 42/1981 variables, 42/1090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1981 variables, 6/1096 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 19:33:39] [INFO ] Deduced a trap composed of 54 places in 525 ms of which 6 ms to minimize.
[2024-05-26 19:33:39] [INFO ] Deduced a trap composed of 54 places in 532 ms of which 7 ms to minimize.
[2024-05-26 19:33:40] [INFO ] Deduced a trap composed of 28 places in 424 ms of which 6 ms to minimize.
[2024-05-26 19:33:40] [INFO ] Deduced a trap composed of 36 places in 537 ms of which 7 ms to minimize.
[2024-05-26 19:33:41] [INFO ] Deduced a trap composed of 34 places in 526 ms of which 6 ms to minimize.
[2024-05-26 19:33:41] [INFO ] Deduced a trap composed of 52 places in 524 ms of which 6 ms to minimize.
[2024-05-26 19:33:42] [INFO ] Deduced a trap composed of 51 places in 523 ms of which 6 ms to minimize.
[2024-05-26 19:33:42] [INFO ] Deduced a trap composed of 34 places in 542 ms of which 6 ms to minimize.
[2024-05-26 19:33:43] [INFO ] Deduced a trap composed of 35 places in 525 ms of which 6 ms to minimize.
[2024-05-26 19:33:44] [INFO ] Deduced a trap composed of 28 places in 524 ms of which 6 ms to minimize.
[2024-05-26 19:33:44] [INFO ] Deduced a trap composed of 123 places in 527 ms of which 7 ms to minimize.
[2024-05-26 19:33:45] [INFO ] Deduced a trap composed of 71 places in 531 ms of which 7 ms to minimize.
[2024-05-26 19:33:45] [INFO ] Deduced a trap composed of 40 places in 532 ms of which 6 ms to minimize.
[2024-05-26 19:33:46] [INFO ] Deduced a trap composed of 20 places in 535 ms of which 6 ms to minimize.
[2024-05-26 19:33:46] [INFO ] Deduced a trap composed of 57 places in 529 ms of which 6 ms to minimize.
[2024-05-26 19:33:47] [INFO ] Deduced a trap composed of 57 places in 525 ms of which 7 ms to minimize.
[2024-05-26 19:33:48] [INFO ] Deduced a trap composed of 124 places in 541 ms of which 6 ms to minimize.
[2024-05-26 19:33:48] [INFO ] Deduced a trap composed of 47 places in 529 ms of which 6 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 65536
[2024-05-26 19:33:49] [INFO ] Deduced a trap composed of 36 places in 511 ms of which 7 ms to minimize.
SDD size :61824 after 253965
[2024-05-26 19:33:49] [INFO ] Deduced a trap composed of 37 places in 523 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1981 variables, 20/1116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 19:33:51] [INFO ] Deduced a trap composed of 37 places in 474 ms of which 6 ms to minimize.
[2024-05-26 19:33:51] [INFO ] Deduced a trap composed of 62 places in 474 ms of which 6 ms to minimize.
[2024-05-26 19:33:52] [INFO ] Deduced a trap composed of 52 places in 480 ms of which 6 ms to minimize.
[2024-05-26 19:33:52] [INFO ] Deduced a trap composed of 16 places in 463 ms of which 6 ms to minimize.
[2024-05-26 19:33:53] [INFO ] Deduced a trap composed of 68 places in 472 ms of which 6 ms to minimize.
[2024-05-26 19:33:53] [INFO ] Deduced a trap composed of 12 places in 439 ms of which 6 ms to minimize.
[2024-05-26 19:33:54] [INFO ] Deduced a trap composed of 27 places in 443 ms of which 6 ms to minimize.
[2024-05-26 19:33:54] [INFO ] Deduced a trap composed of 16 places in 462 ms of which 6 ms to minimize.
[2024-05-26 19:33:55] [INFO ] Deduced a trap composed of 44 places in 463 ms of which 6 ms to minimize.
[2024-05-26 19:33:55] [INFO ] Deduced a trap composed of 18 places in 443 ms of which 6 ms to minimize.
[2024-05-26 19:33:56] [INFO ] Deduced a trap composed of 40 places in 451 ms of which 6 ms to minimize.
[2024-05-26 19:33:56] [INFO ] Deduced a trap composed of 10 places in 459 ms of which 6 ms to minimize.
[2024-05-26 19:33:57] [INFO ] Deduced a trap composed of 106 places in 447 ms of which 6 ms to minimize.
[2024-05-26 19:33:57] [INFO ] Deduced a trap composed of 46 places in 446 ms of which 6 ms to minimize.
[2024-05-26 19:33:58] [INFO ] Deduced a trap composed of 52 places in 438 ms of which 6 ms to minimize.
[2024-05-26 19:33:58] [INFO ] Deduced a trap composed of 12 places in 452 ms of which 5 ms to minimize.
[2024-05-26 19:33:59] [INFO ] Deduced a trap composed of 52 places in 461 ms of which 6 ms to minimize.
[2024-05-26 19:34:00] [INFO ] Deduced a trap composed of 34 places in 494 ms of which 6 ms to minimize.
[2024-05-26 19:34:00] [INFO ] Deduced a trap composed of 27 places in 456 ms of which 6 ms to minimize.
[2024-05-26 19:34:01] [INFO ] Deduced a trap composed of 12 places in 509 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1981 variables, 20/1136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 19:34:02] [INFO ] Deduced a trap composed of 106 places in 489 ms of which 6 ms to minimize.
[2024-05-26 19:34:03] [INFO ] Deduced a trap composed of 121 places in 480 ms of which 6 ms to minimize.
[2024-05-26 19:34:03] [INFO ] Deduced a trap composed of 121 places in 479 ms of which 6 ms to minimize.
[2024-05-26 19:34:04] [INFO ] Deduced a trap composed of 54 places in 500 ms of which 6 ms to minimize.
[2024-05-26 19:34:04] [INFO ] Deduced a trap composed of 100 places in 510 ms of which 6 ms to minimize.
[2024-05-26 19:34:05] [INFO ] Deduced a trap composed of 58 places in 493 ms of which 6 ms to minimize.
[2024-05-26 19:34:06] [INFO ] Deduced a trap composed of 88 places in 497 ms of which 6 ms to minimize.
Detected timeout of ITS tools.
[2024-05-26 19:34:06] [INFO ] Deduced a trap composed of 67 places in 469 ms of which 5 ms to minimize.
[2024-05-26 19:34:07] [INFO ] Deduced a trap composed of 82 places in 493 ms of which 6 ms to minimize.
[2024-05-26 19:34:08] [INFO ] Deduced a trap composed of 81 places in 748 ms of which 10 ms to minimize.
[2024-05-26 19:34:08] [INFO ] Deduced a trap composed of 64 places in 787 ms of which 10 ms to minimize.
[2024-05-26 19:34:09] [INFO ] Deduced a trap composed of 98 places in 786 ms of which 10 ms to minimize.
[2024-05-26 19:34:10] [INFO ] Deduced a trap composed of 70 places in 775 ms of which 10 ms to minimize.
[2024-05-26 19:34:11] [INFO ] Deduced a trap composed of 126 places in 735 ms of which 6 ms to minimize.
[2024-05-26 19:34:11] [INFO ] Deduced a trap composed of 102 places in 519 ms of which 8 ms to minimize.
[2024-05-26 19:34:12] [INFO ] Deduced a trap composed of 66 places in 569 ms of which 9 ms to minimize.
[2024-05-26 19:34:13] [INFO ] Deduced a trap composed of 67 places in 761 ms of which 9 ms to minimize.
[2024-05-26 19:34:14] [INFO ] Deduced a trap composed of 53 places in 767 ms of which 10 ms to minimize.
[2024-05-26 19:34:15] [INFO ] Deduced a trap composed of 34 places in 771 ms of which 9 ms to minimize.
[2024-05-26 19:34:15] [INFO ] Deduced a trap composed of 94 places in 766 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1981 variables, 20/1156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 19:34:18] [INFO ] Deduced a trap composed of 57 places in 828 ms of which 9 ms to minimize.
[2024-05-26 19:34:19] [INFO ] Deduced a trap composed of 12 places in 851 ms of which 12 ms to minimize.
[2024-05-26 19:34:20] [INFO ] Deduced a trap composed of 34 places in 800 ms of which 10 ms to minimize.
[2024-05-26 19:34:21] [INFO ] Deduced a trap composed of 38 places in 778 ms of which 9 ms to minimize.
[2024-05-26 19:34:22] [INFO ] Deduced a trap composed of 39 places in 779 ms of which 10 ms to minimize.
[2024-05-26 19:34:22] [INFO ] Deduced a trap composed of 22 places in 744 ms of which 10 ms to minimize.
[2024-05-26 19:34:23] [INFO ] Deduced a trap composed of 22 places in 723 ms of which 10 ms to minimize.
[2024-05-26 19:34:24] [INFO ] Deduced a trap composed of 105 places in 709 ms of which 8 ms to minimize.
[2024-05-26 19:34:25] [INFO ] Deduced a trap composed of 121 places in 710 ms of which 9 ms to minimize.
[2024-05-26 19:34:26] [INFO ] Deduced a trap composed of 50 places in 736 ms of which 9 ms to minimize.
[2024-05-26 19:34:26] [INFO ] Deduced a trap composed of 39 places in 763 ms of which 9 ms to minimize.
[2024-05-26 19:34:29] [INFO ] Deduced a trap composed of 39 places in 528 ms of which 9 ms to minimize.
[2024-05-26 19:34:29] [INFO ] Deduced a trap composed of 30 places in 725 ms of which 10 ms to minimize.
[2024-05-26 19:34:30] [INFO ] Deduced a trap composed of 50 places in 529 ms of which 8 ms to minimize.
[2024-05-26 19:34:31] [INFO ] Deduced a trap composed of 69 places in 716 ms of which 9 ms to minimize.
[2024-05-26 19:34:32] [INFO ] Deduced a trap composed of 14 places in 701 ms of which 8 ms to minimize.
[2024-05-26 19:34:33] [INFO ] Deduced a trap composed of 37 places in 666 ms of which 9 ms to minimize.
[2024-05-26 19:34:34] [INFO ] Deduced a trap composed of 93 places in 719 ms of which 9 ms to minimize.
[2024-05-26 19:34:35] [INFO ] Deduced a trap composed of 154 places in 716 ms of which 9 ms to minimize.
[2024-05-26 19:34:35] [INFO ] Deduced a trap composed of 99 places in 690 ms of which 10 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1981 variables, 20/1176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 19:34:38] [INFO ] Deduced a trap composed of 28 places in 727 ms of which 9 ms to minimize.
[2024-05-26 19:34:39] [INFO ] Deduced a trap composed of 67 places in 756 ms of which 10 ms to minimize.
[2024-05-26 19:34:40] [INFO ] Deduced a trap composed of 33 places in 791 ms of which 10 ms to minimize.
[2024-05-26 19:34:41] [INFO ] Deduced a trap composed of 46 places in 780 ms of which 10 ms to minimize.
[2024-05-26 19:34:41] [INFO ] Deduced a trap composed of 54 places in 699 ms of which 9 ms to minimize.
[2024-05-26 19:34:42] [INFO ] Deduced a trap composed of 102 places in 753 ms of which 9 ms to minimize.
[2024-05-26 19:34:43] [INFO ] Deduced a trap composed of 114 places in 717 ms of which 9 ms to minimize.
[2024-05-26 19:34:44] [INFO ] Deduced a trap composed of 102 places in 732 ms of which 9 ms to minimize.
[2024-05-26 19:34:45] [INFO ] Deduced a trap composed of 50 places in 716 ms of which 9 ms to minimize.
[2024-05-26 19:34:46] [INFO ] Deduced a trap composed of 71 places in 748 ms of which 9 ms to minimize.
[2024-05-26 19:34:46] [INFO ] Deduced a trap composed of 43 places in 711 ms of which 9 ms to minimize.
[2024-05-26 19:34:47] [INFO ] Deduced a trap composed of 55 places in 691 ms of which 9 ms to minimize.
[2024-05-26 19:34:48] [INFO ] Deduced a trap composed of 88 places in 654 ms of which 10 ms to minimize.
[2024-05-26 19:34:49] [INFO ] Deduced a trap composed of 54 places in 750 ms of which 10 ms to minimize.
[2024-05-26 19:34:50] [INFO ] Deduced a trap composed of 38 places in 427 ms of which 6 ms to minimize.
SMT process timed out in 76696ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 865 ms.
Support contains 301 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 34 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 742/742 places, 1449/1449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 46 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
[2024-05-26 19:34:51] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:34:51] [INFO ] Invariant cache hit.
[2024-05-26 19:34:52] [INFO ] Implicit Places using invariants in 891 ms returned []
[2024-05-26 19:34:52] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:34:52] [INFO ] Invariant cache hit.
[2024-05-26 19:34:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:34:56] [INFO ] Implicit Places using invariants and state equation in 4197 ms returned []
Implicit Place search using SMT with State Equation took 5090 ms to find 0 implicit places.
[2024-05-26 19:34:56] [INFO ] Redundant transitions in 137 ms returned []
Running 1442 sub problems to find dead transitions.
[2024-05-26 19:34:56] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:34:56] [INFO ] Invariant cache hit.
[2024-05-26 19:34:56] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/1981 variables, and 20 constraints, problems are : Problem set: 0 solved, 1442 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/742 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1442/1442 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2024-05-26 19:35:29] [INFO ] Deduced a trap composed of 16 places in 571 ms of which 7 ms to minimize.
[2024-05-26 19:35:30] [INFO ] Deduced a trap composed of 36 places in 541 ms of which 7 ms to minimize.
[2024-05-26 19:35:31] [INFO ] Deduced a trap composed of 33 places in 746 ms of which 9 ms to minimize.
[2024-05-26 19:35:31] [INFO ] Deduced a trap composed of 52 places in 692 ms of which 9 ms to minimize.
[2024-05-26 19:35:32] [INFO ] Deduced a trap composed of 62 places in 628 ms of which 8 ms to minimize.
[2024-05-26 19:35:33] [INFO ] Deduced a trap composed of 60 places in 587 ms of which 7 ms to minimize.
[2024-05-26 19:35:33] [INFO ] Deduced a trap composed of 82 places in 537 ms of which 6 ms to minimize.
[2024-05-26 19:35:34] [INFO ] Deduced a trap composed of 46 places in 485 ms of which 5 ms to minimize.
[2024-05-26 19:35:34] [INFO ] Deduced a trap composed of 123 places in 476 ms of which 5 ms to minimize.
[2024-05-26 19:35:35] [INFO ] Deduced a trap composed of 49 places in 621 ms of which 9 ms to minimize.
[2024-05-26 19:35:35] [INFO ] Deduced a trap composed of 61 places in 463 ms of which 6 ms to minimize.
[2024-05-26 19:35:36] [INFO ] Deduced a trap composed of 28 places in 442 ms of which 5 ms to minimize.
[2024-05-26 19:35:36] [INFO ] Deduced a trap composed of 37 places in 530 ms of which 6 ms to minimize.
[2024-05-26 19:35:37] [INFO ] Deduced a trap composed of 57 places in 713 ms of which 9 ms to minimize.
[2024-05-26 19:35:38] [INFO ] Deduced a trap composed of 39 places in 674 ms of which 8 ms to minimize.
[2024-05-26 19:35:38] [INFO ] Deduced a trap composed of 57 places in 628 ms of which 6 ms to minimize.
[2024-05-26 19:35:39] [INFO ] Deduced a trap composed of 51 places in 549 ms of which 7 ms to minimize.
[2024-05-26 19:35:40] [INFO ] Deduced a trap composed of 16 places in 567 ms of which 8 ms to minimize.
[2024-05-26 19:35:40] [INFO ] Deduced a trap composed of 16 places in 633 ms of which 8 ms to minimize.
[2024-05-26 19:35:41] [INFO ] Deduced a trap composed of 16 places in 675 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/742 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2024-05-26 19:35:42] [INFO ] Deduced a trap composed of 26 places in 714 ms of which 9 ms to minimize.
[2024-05-26 19:35:43] [INFO ] Deduced a trap composed of 26 places in 714 ms of which 9 ms to minimize.
[2024-05-26 19:35:44] [INFO ] Deduced a trap composed of 26 places in 538 ms of which 7 ms to minimize.
[2024-05-26 19:35:44] [INFO ] Deduced a trap composed of 26 places in 548 ms of which 7 ms to minimize.
[2024-05-26 19:35:45] [INFO ] Deduced a trap composed of 26 places in 575 ms of which 7 ms to minimize.
[2024-05-26 19:35:45] [INFO ] Deduced a trap composed of 62 places in 580 ms of which 8 ms to minimize.
[2024-05-26 19:35:46] [INFO ] Deduced a trap composed of 26 places in 635 ms of which 10 ms to minimize.
[2024-05-26 19:35:47] [INFO ] Deduced a trap composed of 22 places in 770 ms of which 10 ms to minimize.
[2024-05-26 19:35:48] [INFO ] Deduced a trap composed of 44 places in 769 ms of which 9 ms to minimize.
[2024-05-26 19:35:49] [INFO ] Deduced a trap composed of 26 places in 795 ms of which 9 ms to minimize.
[2024-05-26 19:35:49] [INFO ] Deduced a trap composed of 37 places in 767 ms of which 10 ms to minimize.
[2024-05-26 19:35:50] [INFO ] Deduced a trap composed of 12 places in 786 ms of which 10 ms to minimize.
[2024-05-26 19:35:51] [INFO ] Deduced a trap composed of 26 places in 711 ms of which 9 ms to minimize.
[2024-05-26 19:35:52] [INFO ] Deduced a trap composed of 14 places in 685 ms of which 8 ms to minimize.
[2024-05-26 19:35:52] [INFO ] Deduced a trap composed of 96 places in 612 ms of which 9 ms to minimize.
[2024-05-26 19:35:53] [INFO ] Deduced a trap composed of 36 places in 533 ms of which 8 ms to minimize.
[2024-05-26 19:35:53] [INFO ] Deduced a trap composed of 22 places in 645 ms of which 8 ms to minimize.
[2024-05-26 19:35:54] [INFO ] Deduced a trap composed of 38 places in 635 ms of which 9 ms to minimize.
[2024-05-26 19:35:55] [INFO ] Deduced a trap composed of 60 places in 609 ms of which 8 ms to minimize.
[2024-05-26 19:35:55] [INFO ] Deduced a trap composed of 34 places in 731 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/742 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2024-05-26 19:35:57] [INFO ] Deduced a trap composed of 38 places in 292 ms of which 5 ms to minimize.
[2024-05-26 19:35:57] [INFO ] Deduced a trap composed of 47 places in 461 ms of which 7 ms to minimize.
SMT process timed out in 61102ms, After SMT, problems are : Problem set: 0 solved, 1442 unsolved
Search for dead transitions found 0 dead transitions in 61133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66420 ms. Remains : 742/742 places, 1449/1449 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 6] Max Struct:[7, 7]
Starting property specific reduction for Peterson-COL-6-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2024-05-26 19:35:57] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:35:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2 resets) in 35 ms. (277 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2024-05-26 19:35:57] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:35:57] [INFO ] Invariant cache hit.
[2024-05-26 19:35:57] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2024-05-26 19:35:58] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2024-05-26 19:35:58] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:35:58] [INFO ] [Real]Added 330 Read/Feed constraints in 59 ms returned sat
[2024-05-26 19:35:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:35:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2024-05-26 19:35:59] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2024-05-26 19:35:59] [INFO ] [Nat]Added 330 Read/Feed constraints in 338 ms returned sat
[2024-05-26 19:36:00] [INFO ] Deduced a trap composed of 66 places in 461 ms of which 6 ms to minimize.
[2024-05-26 19:36:01] [INFO ] Deduced a trap composed of 12 places in 714 ms of which 10 ms to minimize.
[2024-05-26 19:36:01] [INFO ] Deduced a trap composed of 14 places in 697 ms of which 8 ms to minimize.
[2024-05-26 19:36:02] [INFO ] Deduced a trap composed of 28 places in 608 ms of which 9 ms to minimize.
[2024-05-26 19:36:03] [INFO ] Deduced a trap composed of 14 places in 743 ms of which 10 ms to minimize.
[2024-05-26 19:36:04] [INFO ] Deduced a trap composed of 60 places in 723 ms of which 10 ms to minimize.
[2024-05-26 19:36:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 7 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 742 transition count 1371
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 664 transition count 1371
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 216 Pre rules applied. Total rules applied 156 place count 664 transition count 1155
Deduced a syphon composed of 216 places in 1 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 2 with 432 rules applied. Total rules applied 588 place count 448 transition count 1155
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 672 place count 406 transition count 1113
Applied a total of 672 rules in 96 ms. Remains 406 /742 variables (removed 336) and now considering 1113/1449 (removed 336) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 406/742 places, 1113/1449 transitions.
[2024-05-26 19:36:04] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2024-05-26 19:36:04] [INFO ] Computed 20 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 2287 ms. (437 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 692 ms. (1443 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2024-05-26 19:36:07] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:36:07] [INFO ] Invariant cache hit.
[2024-05-26 19:36:07] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2024-05-26 19:36:07] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2024-05-26 19:36:07] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:36:07] [INFO ] [Real]Added 330 Read/Feed constraints in 46 ms returned sat
[2024-05-26 19:36:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:36:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2024-05-26 19:36:08] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2024-05-26 19:36:08] [INFO ] [Nat]Added 330 Read/Feed constraints in 112 ms returned sat
[2024-05-26 19:36:08] [INFO ] Deduced a trap composed of 56 places in 349 ms of which 5 ms to minimize.
[2024-05-26 19:36:09] [INFO ] Deduced a trap composed of 10 places in 410 ms of which 5 ms to minimize.
[2024-05-26 19:36:09] [INFO ] Deduced a trap composed of 12 places in 359 ms of which 5 ms to minimize.
[2024-05-26 19:36:10] [INFO ] Deduced a trap composed of 44 places in 409 ms of which 6 ms to minimize.
[2024-05-26 19:36:10] [INFO ] Deduced a trap composed of 43 places in 409 ms of which 5 ms to minimize.
[2024-05-26 19:36:11] [INFO ] Deduced a trap composed of 40 places in 415 ms of which 6 ms to minimize.
[2024-05-26 19:36:11] [INFO ] Deduced a trap composed of 38 places in 420 ms of which 6 ms to minimize.
[2024-05-26 19:36:12] [INFO ] Deduced a trap composed of 25 places in 422 ms of which 5 ms to minimize.
[2024-05-26 19:36:12] [INFO ] Deduced a trap composed of 27 places in 403 ms of which 6 ms to minimize.
[2024-05-26 19:36:12] [INFO ] Deduced a trap composed of 12 places in 395 ms of which 5 ms to minimize.
[2024-05-26 19:36:13] [INFO ] Deduced a trap composed of 11 places in 345 ms of which 5 ms to minimize.
[2024-05-26 19:36:13] [INFO ] Deduced a trap composed of 66 places in 400 ms of which 6 ms to minimize.
[2024-05-26 19:36:14] [INFO ] Deduced a trap composed of 56 places in 385 ms of which 5 ms to minimize.
[2024-05-26 19:36:14] [INFO ] Deduced a trap composed of 12 places in 411 ms of which 6 ms to minimize.
[2024-05-26 19:36:15] [INFO ] Deduced a trap composed of 49 places in 386 ms of which 5 ms to minimize.
[2024-05-26 19:36:15] [INFO ] Deduced a trap composed of 10 places in 398 ms of which 5 ms to minimize.
[2024-05-26 19:36:16] [INFO ] Deduced a trap composed of 47 places in 406 ms of which 5 ms to minimize.
[2024-05-26 19:36:16] [INFO ] Deduced a trap composed of 14 places in 399 ms of which 6 ms to minimize.
[2024-05-26 19:36:17] [INFO ] Deduced a trap composed of 30 places in 375 ms of which 5 ms to minimize.
[2024-05-26 19:36:17] [INFO ] Deduced a trap composed of 52 places in 380 ms of which 6 ms to minimize.
[2024-05-26 19:36:18] [INFO ] Deduced a trap composed of 53 places in 389 ms of which 5 ms to minimize.
[2024-05-26 19:36:18] [INFO ] Deduced a trap composed of 34 places in 390 ms of which 5 ms to minimize.
[2024-05-26 19:36:18] [INFO ] Deduced a trap composed of 78 places in 395 ms of which 5 ms to minimize.
[2024-05-26 19:36:19] [INFO ] Deduced a trap composed of 30 places in 396 ms of which 5 ms to minimize.
[2024-05-26 19:36:20] [INFO ] Deduced a trap composed of 26 places in 400 ms of which 5 ms to minimize.
[2024-05-26 19:36:20] [INFO ] Deduced a trap composed of 44 places in 395 ms of which 5 ms to minimize.
[2024-05-26 19:36:20] [INFO ] Deduced a trap composed of 27 places in 384 ms of which 5 ms to minimize.
[2024-05-26 19:36:21] [INFO ] Deduced a trap composed of 67 places in 378 ms of which 6 ms to minimize.
[2024-05-26 19:36:21] [INFO ] Deduced a trap composed of 18 places in 396 ms of which 5 ms to minimize.
[2024-05-26 19:36:22] [INFO ] Deduced a trap composed of 43 places in 398 ms of which 5 ms to minimize.
[2024-05-26 19:36:22] [INFO ] Deduced a trap composed of 18 places in 400 ms of which 6 ms to minimize.
[2024-05-26 19:36:23] [INFO ] Deduced a trap composed of 57 places in 409 ms of which 6 ms to minimize.
[2024-05-26 19:36:23] [INFO ] Deduced a trap composed of 26 places in 408 ms of which 6 ms to minimize.
[2024-05-26 19:36:24] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 3 ms to minimize.
[2024-05-26 19:36:25] [INFO ] Deduced a trap composed of 50 places in 314 ms of which 6 ms to minimize.
[2024-05-26 19:36:25] [INFO ] Deduced a trap composed of 60 places in 400 ms of which 5 ms to minimize.
[2024-05-26 19:36:25] [INFO ] Deduced a trap composed of 50 places in 395 ms of which 6 ms to minimize.
[2024-05-26 19:36:26] [INFO ] Deduced a trap composed of 39 places in 378 ms of which 5 ms to minimize.
[2024-05-26 19:36:26] [INFO ] Deduced a trap composed of 18 places in 384 ms of which 5 ms to minimize.
[2024-05-26 19:36:27] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 3 ms to minimize.
[2024-05-26 19:36:28] [INFO ] Deduced a trap composed of 33 places in 293 ms of which 4 ms to minimize.
[2024-05-26 19:36:28] [INFO ] Deduced a trap composed of 48 places in 341 ms of which 4 ms to minimize.
[2024-05-26 19:36:29] [INFO ] Deduced a trap composed of 26 places in 353 ms of which 5 ms to minimize.
[2024-05-26 19:36:30] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 5 ms to minimize.
[2024-05-26 19:36:30] [INFO ] Deduced a trap composed of 19 places in 388 ms of which 5 ms to minimize.
[2024-05-26 19:36:31] [INFO ] Deduced a trap composed of 13 places in 440 ms of which 6 ms to minimize.
[2024-05-26 19:36:31] [INFO ] Deduced a trap composed of 30 places in 421 ms of which 6 ms to minimize.
[2024-05-26 19:36:32] [INFO ] Deduced a trap composed of 52 places in 387 ms of which 5 ms to minimize.
[2024-05-26 19:36:32] [INFO ] Deduced a trap composed of 23 places in 391 ms of which 5 ms to minimize.
[2024-05-26 19:36:34] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 3 ms to minimize.
[2024-05-26 19:36:34] [INFO ] Deduced a trap composed of 41 places in 309 ms of which 5 ms to minimize.
[2024-05-26 19:36:34] [INFO ] Deduced a trap composed of 23 places in 378 ms of which 5 ms to minimize.
[2024-05-26 19:36:36] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 2 ms to minimize.
[2024-05-26 19:36:36] [INFO ] Deduced a trap composed of 27 places in 306 ms of which 5 ms to minimize.
[2024-05-26 19:36:37] [INFO ] Deduced a trap composed of 32 places in 348 ms of which 5 ms to minimize.
[2024-05-26 19:36:37] [INFO ] Deduced a trap composed of 53 places in 397 ms of which 5 ms to minimize.
[2024-05-26 19:36:38] [INFO ] Deduced a trap composed of 64 places in 349 ms of which 6 ms to minimize.
[2024-05-26 19:36:38] [INFO ] Deduced a trap composed of 51 places in 386 ms of which 5 ms to minimize.
[2024-05-26 19:36:39] [INFO ] Deduced a trap composed of 41 places in 388 ms of which 5 ms to minimize.
[2024-05-26 19:36:39] [INFO ] Deduced a trap composed of 37 places in 412 ms of which 6 ms to minimize.
[2024-05-26 19:36:40] [INFO ] Deduced a trap composed of 47 places in 378 ms of which 5 ms to minimize.
[2024-05-26 19:36:40] [INFO ] Deduced a trap composed of 45 places in 354 ms of which 5 ms to minimize.
[2024-05-26 19:36:45] [INFO ] Trap strengthening (SAT) tested/added 62/62 trap constraints in 36673 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 18 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 20 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2024-05-26 19:36:45] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:36:45] [INFO ] Invariant cache hit.
[2024-05-26 19:36:45] [INFO ] Implicit Places using invariants in 659 ms returned []
[2024-05-26 19:36:45] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:36:45] [INFO ] Invariant cache hit.
[2024-05-26 19:36:46] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:36:48] [INFO ] Implicit Places using invariants and state equation in 2739 ms returned []
Implicit Place search using SMT with State Equation took 3399 ms to find 0 implicit places.
[2024-05-26 19:36:48] [INFO ] Redundant transitions in 36 ms returned []
Running 1106 sub problems to find dead transitions.
[2024-05-26 19:36:48] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:36:48] [INFO ] Invariant cache hit.
[2024-05-26 19:36:48] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:37:03] [INFO ] Deduced a trap composed of 21 places in 467 ms of which 6 ms to minimize.
[2024-05-26 19:37:04] [INFO ] Deduced a trap composed of 20 places in 446 ms of which 6 ms to minimize.
[2024-05-26 19:37:04] [INFO ] Deduced a trap composed of 21 places in 449 ms of which 6 ms to minimize.
[2024-05-26 19:37:05] [INFO ] Deduced a trap composed of 22 places in 453 ms of which 6 ms to minimize.
[2024-05-26 19:37:05] [INFO ] Deduced a trap composed of 19 places in 427 ms of which 5 ms to minimize.
[2024-05-26 19:37:06] [INFO ] Deduced a trap composed of 25 places in 441 ms of which 6 ms to minimize.
[2024-05-26 19:37:06] [INFO ] Deduced a trap composed of 13 places in 442 ms of which 6 ms to minimize.
[2024-05-26 19:37:07] [INFO ] Deduced a trap composed of 14 places in 426 ms of which 6 ms to minimize.
[2024-05-26 19:37:07] [INFO ] Deduced a trap composed of 23 places in 374 ms of which 6 ms to minimize.
[2024-05-26 19:37:07] [INFO ] Deduced a trap composed of 44 places in 422 ms of which 6 ms to minimize.
[2024-05-26 19:37:08] [INFO ] Deduced a trap composed of 14 places in 406 ms of which 6 ms to minimize.
[2024-05-26 19:37:08] [INFO ] Deduced a trap composed of 23 places in 395 ms of which 5 ms to minimize.
[2024-05-26 19:37:09] [INFO ] Deduced a trap composed of 23 places in 402 ms of which 6 ms to minimize.
[2024-05-26 19:37:09] [INFO ] Deduced a trap composed of 84 places in 438 ms of which 5 ms to minimize.
[2024-05-26 19:37:09] [INFO ] Deduced a trap composed of 77 places in 438 ms of which 5 ms to minimize.
[2024-05-26 19:37:10] [INFO ] Deduced a trap composed of 67 places in 424 ms of which 5 ms to minimize.
[2024-05-26 19:37:10] [INFO ] Deduced a trap composed of 81 places in 431 ms of which 5 ms to minimize.
[2024-05-26 19:37:11] [INFO ] Deduced a trap composed of 44 places in 429 ms of which 5 ms to minimize.
[2024-05-26 19:37:11] [INFO ] Deduced a trap composed of 23 places in 441 ms of which 5 ms to minimize.
[2024-05-26 19:37:12] [INFO ] Deduced a trap composed of 23 places in 416 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:37:13] [INFO ] Deduced a trap composed of 44 places in 416 ms of which 6 ms to minimize.
[2024-05-26 19:37:13] [INFO ] Deduced a trap composed of 21 places in 441 ms of which 5 ms to minimize.
[2024-05-26 19:37:14] [INFO ] Deduced a trap composed of 24 places in 450 ms of which 5 ms to minimize.
[2024-05-26 19:37:14] [INFO ] Deduced a trap composed of 46 places in 447 ms of which 6 ms to minimize.
[2024-05-26 19:37:15] [INFO ] Deduced a trap composed of 43 places in 450 ms of which 6 ms to minimize.
[2024-05-26 19:37:15] [INFO ] Deduced a trap composed of 52 places in 458 ms of which 6 ms to minimize.
[2024-05-26 19:37:16] [INFO ] Deduced a trap composed of 43 places in 444 ms of which 6 ms to minimize.
[2024-05-26 19:37:16] [INFO ] Deduced a trap composed of 13 places in 388 ms of which 5 ms to minimize.
[2024-05-26 19:37:16] [INFO ] Deduced a trap composed of 38 places in 428 ms of which 6 ms to minimize.
[2024-05-26 19:37:17] [INFO ] Deduced a trap composed of 23 places in 380 ms of which 6 ms to minimize.
[2024-05-26 19:37:17] [INFO ] Deduced a trap composed of 23 places in 419 ms of which 6 ms to minimize.
[2024-05-26 19:37:18] [INFO ] Deduced a trap composed of 39 places in 396 ms of which 6 ms to minimize.
[2024-05-26 19:37:18] [INFO ] Deduced a trap composed of 10 places in 369 ms of which 5 ms to minimize.
[2024-05-26 19:37:18] [INFO ] Deduced a trap composed of 12 places in 447 ms of which 5 ms to minimize.
[2024-05-26 19:37:19] [INFO ] Deduced a trap composed of 21 places in 428 ms of which 6 ms to minimize.
SMT process timed out in 30716ms, After SMT, problems are : Problem set: 0 solved, 1106 unsolved
Search for dead transitions found 0 dead transitions in 30741ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34208 ms. Remains : 406/406 places, 1113/1113 transitions.
[2024-05-26 19:37:19] [INFO ] Flatten gal took : 262 ms
RANDOM walk for 40000 steps (8 resets) in 706 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
[2024-05-26 19:37:19] [INFO ] Flatten gal took : 207 ms
[2024-05-26 19:37:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9216363774991978293.gal : 22 ms
[2024-05-26 19:37:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3343237508946310906.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9216363774991978293.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3343237508946310906.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3343237508946310906.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 105
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :105 after 219
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :219 after 364
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :364 after 501
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :501 after 2927
Interrupted probabilistic random walk after 355640 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 2
Probabilistic random walk after 355640 steps, saw 50261 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-26 19:37:22] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:37:22] [INFO ] Invariant cache hit.
[2024-05-26 19:37:22] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/1309 variables, 42/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 6/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 756 constraints, problems are : Problem set: 0 solved, 2 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1267 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 42/1309 variables, 42/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 6/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:37:24] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 4 ms to minimize.
[2024-05-26 19:37:24] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2927 after 6419
[2024-05-26 19:37:24] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 3 ms to minimize.
[2024-05-26 19:37:25] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 3 ms to minimize.
[2024-05-26 19:37:25] [INFO ] Deduced a trap composed of 43 places in 259 ms of which 3 ms to minimize.
[2024-05-26 19:37:25] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 4 ms to minimize.
[2024-05-26 19:37:26] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 3 ms to minimize.
[2024-05-26 19:37:26] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 4 ms to minimize.
[2024-05-26 19:37:26] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 4 ms to minimize.
[2024-05-26 19:37:26] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6419 after 9778
[2024-05-26 19:37:27] [INFO ] Deduced a trap composed of 60 places in 260 ms of which 3 ms to minimize.
[2024-05-26 19:37:27] [INFO ] Deduced a trap composed of 46 places in 253 ms of which 4 ms to minimize.
[2024-05-26 19:37:27] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 4 ms to minimize.
[2024-05-26 19:37:27] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 3 ms to minimize.
[2024-05-26 19:37:28] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 3 ms to minimize.
[2024-05-26 19:37:28] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 3 ms to minimize.
[2024-05-26 19:37:28] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 4 ms to minimize.
SMT process timed out in 5853ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 16 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 694 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 370872 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 2
Probabilistic random walk after 370872 steps, saw 54869 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-05-26 19:37:32] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:37:32] [INFO ] Invariant cache hit.
[2024-05-26 19:37:32] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/1309 variables, 42/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 6/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 756 constraints, problems are : Problem set: 0 solved, 2 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1267 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 42/1309 variables, 42/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 6/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:37:33] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 4 ms to minimize.
[2024-05-26 19:37:33] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 4 ms to minimize.
[2024-05-26 19:37:34] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 3 ms to minimize.
[2024-05-26 19:37:34] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 3 ms to minimize.
[2024-05-26 19:37:34] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 4 ms to minimize.
[2024-05-26 19:37:34] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 4 ms to minimize.
[2024-05-26 19:37:35] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 4 ms to minimize.
[2024-05-26 19:37:35] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 3 ms to minimize.
[2024-05-26 19:37:35] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 4 ms to minimize.
[2024-05-26 19:37:36] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 4 ms to minimize.
[2024-05-26 19:37:36] [INFO ] Deduced a trap composed of 60 places in 213 ms of which 3 ms to minimize.
[2024-05-26 19:37:36] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 4 ms to minimize.
[2024-05-26 19:37:36] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 4 ms to minimize.
[2024-05-26 19:37:37] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 4 ms to minimize.
[2024-05-26 19:37:37] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 3 ms to minimize.
[2024-05-26 19:37:37] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 3 ms to minimize.
[2024-05-26 19:37:37] [INFO ] Deduced a trap composed of 37 places in 257 ms of which 3 ms to minimize.
[2024-05-26 19:37:38] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 4 ms to minimize.
[2024-05-26 19:37:38] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 4 ms to minimize.
[2024-05-26 19:37:38] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1309 variables, 20/778 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:37:39] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 3 ms to minimize.
[2024-05-26 19:37:39] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 3 ms to minimize.
[2024-05-26 19:37:39] [INFO ] Deduced a trap composed of 30 places in 260 ms of which 3 ms to minimize.
[2024-05-26 19:37:39] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 4 ms to minimize.
[2024-05-26 19:37:40] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 4 ms to minimize.
[2024-05-26 19:37:40] [INFO ] Deduced a trap composed of 29 places in 235 ms of which 4 ms to minimize.
[2024-05-26 19:37:40] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 4 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-26 19:37:40] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :9778 after 59948
[2024-05-26 19:37:41] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 3 ms to minimize.
[2024-05-26 19:37:41] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 3 ms to minimize.
[2024-05-26 19:37:41] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 3 ms to minimize.
[2024-05-26 19:37:41] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 3 ms to minimize.
[2024-05-26 19:37:41] [INFO ] Deduced a trap composed of 71 places in 196 ms of which 3 ms to minimize.
[2024-05-26 19:37:42] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 3 ms to minimize.
[2024-05-26 19:37:42] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 3 ms to minimize.
[2024-05-26 19:37:42] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 3 ms to minimize.
[2024-05-26 19:37:42] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 3 ms to minimize.
[2024-05-26 19:37:43] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 3 ms to minimize.
[2024-05-26 19:37:43] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 3 ms to minimize.
[2024-05-26 19:37:43] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 20/798 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 19:37:43] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 3 ms to minimize.
[2024-05-26 19:37:43] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 3 ms to minimize.
[2024-05-26 19:37:44] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 5 ms to minimize.
[2024-05-26 19:37:44] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 3 ms to minimize.
[2024-05-26 19:37:44] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 3 ms to minimize.
[2024-05-26 19:37:45] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 3 ms to minimize.
[2024-05-26 19:37:45] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 3 ms to minimize.
[2024-05-26 19:37:45] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 3 ms to minimize.
[2024-05-26 19:37:45] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 4 ms to minimize.
[2024-05-26 19:37:45] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 3 ms to minimize.
[2024-05-26 19:37:46] [INFO ] Deduced a trap composed of 56 places in 191 ms of which 4 ms to minimize.
[2024-05-26 19:37:46] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 3 ms to minimize.
[2024-05-26 19:37:46] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2024-05-26 19:37:46] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 3 ms to minimize.
[2024-05-26 19:37:46] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 3 ms to minimize.
[2024-05-26 19:37:47] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 3 ms to minimize.
[2024-05-26 19:37:47] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 3 ms to minimize.
[2024-05-26 19:37:47] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 3 ms to minimize.
[2024-05-26 19:37:47] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 3 ms to minimize.
[2024-05-26 19:37:47] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 20/818 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 19:37:48] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 3 ms to minimize.
[2024-05-26 19:37:48] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 2 ms to minimize.
[2024-05-26 19:37:48] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-05-26 19:37:48] [INFO ] Deduced a trap composed of 54 places in 185 ms of which 3 ms to minimize.
[2024-05-26 19:37:49] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
[2024-05-26 19:37:49] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 3 ms to minimize.
[2024-05-26 19:37:49] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 3 ms to minimize.
[2024-05-26 19:37:49] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 3 ms to minimize.
[2024-05-26 19:37:50] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 2 ms to minimize.
[2024-05-26 19:37:50] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-05-26 19:37:50] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 3 ms to minimize.
[2024-05-26 19:37:50] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-05-26 19:37:50] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 3 ms to minimize.
[2024-05-26 19:37:51] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 3 ms to minimize.
[2024-05-26 19:37:51] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 3 ms to minimize.
[2024-05-26 19:37:51] [INFO ] Deduced a trap composed of 66 places in 209 ms of which 3 ms to minimize.
[2024-05-26 19:37:52] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 3 ms to minimize.
[2024-05-26 19:37:52] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 3 ms to minimize.
[2024-05-26 19:37:52] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 3 ms to minimize.
[2024-05-26 19:37:52] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 20/838 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 19:37:52] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 3 ms to minimize.
[2024-05-26 19:37:53] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 3 ms to minimize.
[2024-05-26 19:37:53] [INFO ] Deduced a trap composed of 54 places in 180 ms of which 3 ms to minimize.
[2024-05-26 19:37:53] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2024-05-26 19:37:53] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-05-26 19:37:53] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 2 ms to minimize.
[2024-05-26 19:37:54] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 3 ms to minimize.
[2024-05-26 19:37:54] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 3 ms to minimize.
[2024-05-26 19:37:54] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2024-05-26 19:37:54] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-05-26 19:37:54] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-26 19:37:55] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 4 ms to minimize.
[2024-05-26 19:37:55] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 3 ms to minimize.
[2024-05-26 19:37:55] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 3 ms to minimize.
[2024-05-26 19:37:55] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 3 ms to minimize.
[2024-05-26 19:37:56] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 2 ms to minimize.
[2024-05-26 19:37:56] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 2 ms to minimize.
[2024-05-26 19:37:56] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 2 ms to minimize.
[2024-05-26 19:37:56] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2024-05-26 19:37:57] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/858 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 19:37:57] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
[2024-05-26 19:37:57] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 3 ms to minimize.
[2024-05-26 19:37:57] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 2 ms to minimize.
[2024-05-26 19:37:57] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2024-05-26 19:37:58] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 3 ms to minimize.
[2024-05-26 19:37:58] [INFO ] Deduced a trap composed of 54 places in 222 ms of which 3 ms to minimize.
[2024-05-26 19:37:58] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 3 ms to minimize.
[2024-05-26 19:37:58] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 3 ms to minimize.
[2024-05-26 19:37:59] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 3 ms to minimize.
[2024-05-26 19:37:59] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-05-26 19:37:59] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-05-26 19:37:59] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 3 ms to minimize.
[2024-05-26 19:37:59] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 3 ms to minimize.
[2024-05-26 19:37:59] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 2 ms to minimize.
[2024-05-26 19:38:00] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 3 ms to minimize.
[2024-05-26 19:38:00] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
[2024-05-26 19:38:00] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2024-05-26 19:38:00] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-26 19:38:01] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 3 ms to minimize.
[2024-05-26 19:38:01] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1309 variables, 20/878 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 19:38:01] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 2 ms to minimize.
[2024-05-26 19:38:02] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 3 ms to minimize.
[2024-05-26 19:38:02] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 3 ms to minimize.
[2024-05-26 19:38:02] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
[2024-05-26 19:38:02] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 3 ms to minimize.
SDD size :59948 after 143717
[2024-05-26 19:38:03] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2024-05-26 19:38:03] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-05-26 19:38:05] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 2 ms to minimize.
[2024-05-26 19:38:05] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 3 ms to minimize.
[2024-05-26 19:38:05] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-26 19:38:06] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-26 19:38:06] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 3 ms to minimize.
[2024-05-26 19:38:06] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 2 ms to minimize.
[2024-05-26 19:38:06] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 3 ms to minimize.
[2024-05-26 19:38:07] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-05-26 19:38:07] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 3 ms to minimize.
[2024-05-26 19:38:07] [INFO ] Deduced a trap composed of 84 places in 234 ms of which 4 ms to minimize.
[2024-05-26 19:38:08] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 4 ms to minimize.
[2024-05-26 19:38:08] [INFO ] Deduced a trap composed of 83 places in 199 ms of which 3 ms to minimize.
[2024-05-26 19:38:08] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1309 variables, 20/898 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 19:38:08] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 3 ms to minimize.
[2024-05-26 19:38:08] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 4 ms to minimize.
[2024-05-26 19:38:09] [INFO ] Deduced a trap composed of 60 places in 214 ms of which 3 ms to minimize.
[2024-05-26 19:38:09] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 3 ms to minimize.
[2024-05-26 19:38:09] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2024-05-26 19:38:10] [INFO ] Deduced a trap composed of 37 places in 245 ms of which 3 ms to minimize.
[2024-05-26 19:38:10] [INFO ] Flatten gal took : 44 ms
[2024-05-26 19:38:10] [INFO ] Applying decomposition
[2024-05-26 19:38:10] [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/graph7709642519204227406.txt' '-o' '/tmp/graph7709642519204227406.bin' '-w' '/tmp/graph7709642519204227406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7709642519204227406.bin' '-l' '-1' '-v' '-w' '/tmp/graph7709642519204227406.weights' '-q' '0' '-e' '0.001'
[2024-05-26 19:38:10] [INFO ] Decomposing Gal with order
[2024-05-26 19:38:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 19:38:10] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 3 ms to minimize.
[2024-05-26 19:38:10] [INFO ] Removed a total of 1626 redundant transitions.
[2024-05-26 19:38:10] [INFO ] Flatten gal took : 117 ms
[2024-05-26 19:38:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-26 19:38:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13129098398699173543.gal : 15 ms
[2024-05-26 19:38:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9767731765644355342.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13129098398699173543.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9767731765644355342.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2024-05-26 19:38:10] [INFO ] Deduced a trap composed of 21 places in 341 ms of which 4 ms to minimize.
Loading property file /tmp/ReachabilityCardinality9767731765644355342.prop.
[2024-05-26 19:38:10] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 25
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :25 after 32
[2024-05-26 19:38:11] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :32 after 180
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :180 after 382
[2024-05-26 19:38:11] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :382 after 514
[2024-05-26 19:38:11] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 3 ms to minimize.
[2024-05-26 19:38:11] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 3 ms to minimize.
[2024-05-26 19:38:12] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :514 after 2748
[2024-05-26 19:38:12] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 3 ms to minimize.
[2024-05-26 19:38:12] [INFO ] Deduced a trap composed of 75 places in 171 ms of which 3 ms to minimize.
[2024-05-26 19:38:12] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 4 ms to minimize.
[2024-05-26 19:38:12] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2748 after 7410
[2024-05-26 19:38:13] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 2 ms to minimize.
[2024-05-26 19:38:13] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1309 variables, 20/918 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 19:38:13] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2024-05-26 19:38:13] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 2 ms to minimize.
[2024-05-26 19:38:13] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 2 ms to minimize.
[2024-05-26 19:38:14] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
[2024-05-26 19:38:14] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7410 after 29959
[2024-05-26 19:38:16] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 924 constraints, problems are : Problem set: 1 solved, 1 unsolved in 45007 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 166/166 constraints]
After SMT, in 45653ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 16 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :29959 after 64563
Interrupted probabilistic random walk after 502672 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 502672 steps, saw 71249 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-26 19:38:20] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:38:20] [INFO ] Invariant cache hit.
[2024-05-26 19:38:20] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 42/1309 variables, 42/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 6/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 756 constraints, problems are : Problem set: 0 solved, 1 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1267 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/1309 variables, 42/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 6/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:38:21] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 3 ms to minimize.
[2024-05-26 19:38:22] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 3 ms to minimize.
[2024-05-26 19:38:22] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 3 ms to minimize.
[2024-05-26 19:38:22] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 3 ms to minimize.
[2024-05-26 19:38:22] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 3 ms to minimize.
[2024-05-26 19:38:23] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 3 ms to minimize.
[2024-05-26 19:38:23] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 3 ms to minimize.
[2024-05-26 19:38:23] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 4 ms to minimize.
[2024-05-26 19:38:23] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 3 ms to minimize.
[2024-05-26 19:38:24] [INFO ] Deduced a trap composed of 73 places in 220 ms of which 3 ms to minimize.
[2024-05-26 19:38:24] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 3 ms to minimize.
[2024-05-26 19:38:24] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 3 ms to minimize.
[2024-05-26 19:38:25] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 4 ms to minimize.
[2024-05-26 19:38:25] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 4 ms to minimize.
[2024-05-26 19:38:25] [INFO ] Deduced a trap composed of 10 places in 242 ms of which 4 ms to minimize.
[2024-05-26 19:38:25] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 3 ms to minimize.
[2024-05-26 19:38:26] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 3 ms to minimize.
[2024-05-26 19:38:26] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 3 ms to minimize.
[2024-05-26 19:38:26] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 3 ms to minimize.
[2024-05-26 19:38:26] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1309 variables, 20/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:38:27] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 3 ms to minimize.
[2024-05-26 19:38:27] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 3 ms to minimize.
[2024-05-26 19:38:27] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 4 ms to minimize.
[2024-05-26 19:38:27] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 3 ms to minimize.
[2024-05-26 19:38:28] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
[2024-05-26 19:38:28] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 3 ms to minimize.
[2024-05-26 19:38:28] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 3 ms to minimize.
[2024-05-26 19:38:28] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 3 ms to minimize.
[2024-05-26 19:38:28] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
[2024-05-26 19:38:29] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 3 ms to minimize.
SDD size :64563 after 185090
[2024-05-26 19:38:29] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
[2024-05-26 19:38:29] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 3 ms to minimize.
[2024-05-26 19:38:29] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 3 ms to minimize.
[2024-05-26 19:38:30] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 3 ms to minimize.
[2024-05-26 19:38:30] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 3 ms to minimize.
[2024-05-26 19:38:30] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 3 ms to minimize.
[2024-05-26 19:38:30] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 3 ms to minimize.
[2024-05-26 19:38:31] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 3 ms to minimize.
[2024-05-26 19:38:31] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 3 ms to minimize.
[2024-05-26 19:38:31] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 20/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:38:31] [INFO ] Deduced a trap composed of 68 places in 183 ms of which 3 ms to minimize.
[2024-05-26 19:38:32] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 3 ms to minimize.
[2024-05-26 19:38:32] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 4 ms to minimize.
[2024-05-26 19:38:32] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 3 ms to minimize.
[2024-05-26 19:38:32] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 3 ms to minimize.
[2024-05-26 19:38:33] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 3 ms to minimize.
[2024-05-26 19:38:33] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 3 ms to minimize.
[2024-05-26 19:38:33] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 4 ms to minimize.
[2024-05-26 19:38:33] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 3 ms to minimize.
[2024-05-26 19:38:34] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 2 ms to minimize.
[2024-05-26 19:38:34] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 3 ms to minimize.
[2024-05-26 19:38:34] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 3 ms to minimize.
[2024-05-26 19:38:34] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 3 ms to minimize.
[2024-05-26 19:38:35] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 3 ms to minimize.
[2024-05-26 19:38:35] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 4 ms to minimize.
[2024-05-26 19:38:35] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 3 ms to minimize.
[2024-05-26 19:38:35] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 3 ms to minimize.
[2024-05-26 19:38:36] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 3 ms to minimize.
[2024-05-26 19:38:36] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 3 ms to minimize.
[2024-05-26 19:38:36] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 20/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:38:36] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 3 ms to minimize.
[2024-05-26 19:38:36] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 2 ms to minimize.
[2024-05-26 19:38:37] [INFO ] Deduced a trap composed of 74 places in 227 ms of which 3 ms to minimize.
[2024-05-26 19:38:37] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 3 ms to minimize.
[2024-05-26 19:38:38] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 3 ms to minimize.
[2024-05-26 19:38:38] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 5 ms to minimize.
[2024-05-26 19:38:38] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 3 ms to minimize.
[2024-05-26 19:38:38] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 2 ms to minimize.
[2024-05-26 19:38:38] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 3 ms to minimize.
[2024-05-26 19:38:38] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 3 ms to minimize.
[2024-05-26 19:38:39] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-05-26 19:38:39] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-05-26 19:38:40] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 3 ms to minimize.
[2024-05-26 19:38:40] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 2 ms to minimize.
[2024-05-26 19:38:40] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-05-26 19:38:40] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
[2024-05-26 19:38:40] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
[2024-05-26 19:38:41] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 3 ms to minimize.
[2024-05-26 19:38:41] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 3 ms to minimize.
[2024-05-26 19:38:41] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 20/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:38:41] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 3 ms to minimize.
[2024-05-26 19:38:41] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 3 ms to minimize.
[2024-05-26 19:38:42] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 3 ms to minimize.
[2024-05-26 19:38:44] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 3 ms to minimize.
[2024-05-26 19:38:45] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 3 ms to minimize.
[2024-05-26 19:38:45] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 3 ms to minimize.
[2024-05-26 19:38:45] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 2 ms to minimize.
[2024-05-26 19:38:46] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 3 ms to minimize.
[2024-05-26 19:38:46] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 3 ms to minimize.
[2024-05-26 19:38:46] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 3 ms to minimize.
[2024-05-26 19:38:46] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 3 ms to minimize.
[2024-05-26 19:38:47] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 3 ms to minimize.
[2024-05-26 19:38:47] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 3 ms to minimize.
[2024-05-26 19:38:47] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 3 ms to minimize.
[2024-05-26 19:38:47] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-05-26 19:38:48] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 3 ms to minimize.
[2024-05-26 19:38:48] [INFO ] Deduced a trap composed of 67 places in 164 ms of which 3 ms to minimize.
[2024-05-26 19:38:48] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-05-26 19:38:48] [INFO ] Deduced a trap composed of 61 places in 190 ms of which 3 ms to minimize.
[2024-05-26 19:38:49] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:38:49] [INFO ] Deduced a trap composed of 50 places in 161 ms of which 3 ms to minimize.
[2024-05-26 19:38:49] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 3 ms to minimize.
[2024-05-26 19:38:50] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 4 ms to minimize.
[2024-05-26 19:38:50] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 3 ms to minimize.
[2024-05-26 19:38:50] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 2 ms to minimize.
[2024-05-26 19:38:51] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 3 ms to minimize.
[2024-05-26 19:38:51] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 3 ms to minimize.
[2024-05-26 19:38:51] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 3 ms to minimize.
[2024-05-26 19:38:51] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 3 ms to minimize.
[2024-05-26 19:38:52] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 2 ms to minimize.
[2024-05-26 19:38:52] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 3 ms to minimize.
[2024-05-26 19:38:52] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2024-05-26 19:38:52] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 3 ms to minimize.
[2024-05-26 19:38:52] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
[2024-05-26 19:38:53] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 2 ms to minimize.
[2024-05-26 19:38:53] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 2 ms to minimize.
[2024-05-26 19:38:53] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 2 ms to minimize.
[2024-05-26 19:38:53] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 2 ms to minimize.
[2024-05-26 19:38:53] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 3 ms to minimize.
[2024-05-26 19:38:54] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1309 variables, 20/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:38:54] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 3 ms to minimize.
[2024-05-26 19:38:54] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 3 ms to minimize.
[2024-05-26 19:38:54] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2024-05-26 19:38:55] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 2 ms to minimize.
[2024-05-26 19:38:55] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 3 ms to minimize.
[2024-05-26 19:38:55] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 3 ms to minimize.
[2024-05-26 19:38:55] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 2 ms to minimize.
[2024-05-26 19:38:56] [INFO ] Deduced a trap composed of 58 places in 162 ms of which 3 ms to minimize.
[2024-05-26 19:38:56] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 3 ms to minimize.
[2024-05-26 19:38:57] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :185090 after 1.04554e+06
[2024-05-26 19:38:59] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 2 ms to minimize.
[2024-05-26 19:39:00] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 3 ms to minimize.
[2024-05-26 19:39:00] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2024-05-26 19:39:01] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 3 ms to minimize.
[2024-05-26 19:39:02] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 4 ms to minimize.
[2024-05-26 19:39:02] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 3 ms to minimize.
[2024-05-26 19:39:02] [INFO ] Deduced a trap composed of 43 places in 287 ms of which 4 ms to minimize.
[2024-05-26 19:39:03] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 4 ms to minimize.
[2024-05-26 19:39:03] [INFO ] Deduced a trap composed of 35 places in 263 ms of which 4 ms to minimize.
[2024-05-26 19:39:03] [INFO ] Deduced a trap composed of 42 places in 272 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1309 variables, 20/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:39:04] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 4 ms to minimize.
[2024-05-26 19:39:05] [INFO ] Deduced a trap composed of 61 places in 283 ms of which 4 ms to minimize.
[2024-05-26 19:39:05] [INFO ] Deduced a trap composed of 52 places in 283 ms of which 5 ms to minimize.
[2024-05-26 19:39:05] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 3 ms to minimize.
[2024-05-26 19:39:06] [INFO ] Deduced a trap composed of 49 places in 267 ms of which 4 ms to minimize.
[2024-05-26 19:39:07] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-05-26 19:39:08] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 4 ms to minimize.
[2024-05-26 19:39:08] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 4 ms to minimize.
[2024-05-26 19:39:08] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 3 ms to minimize.
[2024-05-26 19:39:08] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 3 ms to minimize.
[2024-05-26 19:39:09] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 7 ms to minimize.
[2024-05-26 19:39:10] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 3 ms to minimize.
[2024-05-26 19:39:10] [INFO ] Deduced a trap composed of 69 places in 195 ms of which 3 ms to minimize.
[2024-05-26 19:39:11] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 3 ms to minimize.
[2024-05-26 19:39:11] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 3 ms to minimize.
[2024-05-26 19:39:12] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-26 19:39:14] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
[2024-05-26 19:39:14] [INFO ] Deduced a trap composed of 35 places in 405 ms of which 6 ms to minimize.
[2024-05-26 19:39:15] [INFO ] Deduced a trap composed of 38 places in 402 ms of which 6 ms to minimize.
[2024-05-26 19:39:15] [INFO ] Deduced a trap composed of 29 places in 442 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1309 variables, 20/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:39:16] [INFO ] Deduced a trap composed of 28 places in 439 ms of which 5 ms to minimize.
[2024-05-26 19:39:16] [INFO ] Deduced a trap composed of 52 places in 279 ms of which 4 ms to minimize.
[2024-05-26 19:39:17] [INFO ] Deduced a trap composed of 11 places in 322 ms of which 5 ms to minimize.
[2024-05-26 19:39:17] [INFO ] Deduced a trap composed of 42 places in 272 ms of which 4 ms to minimize.
[2024-05-26 19:39:18] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 2 ms to minimize.
[2024-05-26 19:39:18] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 2 ms to minimize.
[2024-05-26 19:39:19] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 3 ms to minimize.
[2024-05-26 19:39:19] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 3 ms to minimize.
[2024-05-26 19:39:20] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
[2024-05-26 19:39:21] [INFO ] Deduced a trap composed of 96 places in 321 ms of which 4 ms to minimize.
[2024-05-26 19:39:22] [INFO ] Deduced a trap composed of 43 places in 405 ms of which 5 ms to minimize.
[2024-05-26 19:39:23] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 2 ms to minimize.
[2024-05-26 19:39:23] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 4 ms to minimize.
[2024-05-26 19:39:24] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 3 ms to minimize.
[2024-05-26 19:39:25] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 3 ms to minimize.
[2024-05-26 19:39:25] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 4 ms to minimize.
[2024-05-26 19:39:26] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 4 ms to minimize.
[2024-05-26 19:39:26] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 3 ms to minimize.
[2024-05-26 19:39:27] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 2 ms to minimize.
[2024-05-26 19:39:27] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1309 variables, 20/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 19:39:28] [INFO ] Deduced a trap composed of 71 places in 248 ms of which 4 ms to minimize.
[2024-05-26 19:39:28] [INFO ] Deduced a trap composed of 46 places in 237 ms of which 4 ms to minimize.
[2024-05-26 19:39:29] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
[2024-05-26 19:39:31] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 4 ms to minimize.
[2024-05-26 19:39:31] [INFO ] Deduced a trap composed of 45 places in 249 ms of which 3 ms to minimize.
[2024-05-26 19:39:31] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 4 ms to minimize.
[2024-05-26 19:39:32] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 4 ms to minimize.
[2024-05-26 19:39:32] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 3 ms to minimize.
[2024-05-26 19:39:32] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 3 ms to minimize.
[2024-05-26 19:39:33] [INFO ] Deduced a trap composed of 58 places in 303 ms of which 4 ms to minimize.
[2024-05-26 19:39:34] [INFO ] Deduced a trap composed of 36 places in 296 ms of which 5 ms to minimize.
[2024-05-26 19:39:34] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 4 ms to minimize.
[2024-05-26 19:39:35] [INFO ] Deduced a trap composed of 44 places in 266 ms of which 4 ms to minimize.
[2024-05-26 19:39:35] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 3 ms to minimize.
[2024-05-26 19:39:35] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 952 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75010 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 195/195 constraints]
After SMT, in 75448ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 28 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 27 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2024-05-26 19:39:36] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:39:36] [INFO ] Invariant cache hit.
[2024-05-26 19:39:36] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-05-26 19:39:36] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:39:36] [INFO ] Invariant cache hit.
[2024-05-26 19:39:37] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:39:39] [INFO ] Implicit Places using invariants and state equation in 2750 ms returned []
Implicit Place search using SMT with State Equation took 3317 ms to find 0 implicit places.
[2024-05-26 19:39:39] [INFO ] Redundant transitions in 23 ms returned []
Running 1106 sub problems to find dead transitions.
[2024-05-26 19:39:39] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2024-05-26 19:39:39] [INFO ] Invariant cache hit.
[2024-05-26 19:39:39] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:39:55] [INFO ] Deduced a trap composed of 21 places in 487 ms of which 7 ms to minimize.
[2024-05-26 19:39:55] [INFO ] Deduced a trap composed of 20 places in 471 ms of which 6 ms to minimize.
[2024-05-26 19:39:56] [INFO ] Deduced a trap composed of 21 places in 466 ms of which 6 ms to minimize.
[2024-05-26 19:39:56] [INFO ] Deduced a trap composed of 22 places in 478 ms of which 6 ms to minimize.
[2024-05-26 19:39:57] [INFO ] Deduced a trap composed of 19 places in 460 ms of which 6 ms to minimize.
[2024-05-26 19:39:57] [INFO ] Deduced a trap composed of 25 places in 478 ms of which 6 ms to minimize.
[2024-05-26 19:39:58] [INFO ] Deduced a trap composed of 13 places in 462 ms of which 6 ms to minimize.
[2024-05-26 19:39:58] [INFO ] Deduced a trap composed of 14 places in 455 ms of which 6 ms to minimize.
[2024-05-26 19:39:59] [INFO ] Deduced a trap composed of 23 places in 441 ms of which 5 ms to minimize.
[2024-05-26 19:39:59] [INFO ] Deduced a trap composed of 44 places in 470 ms of which 6 ms to minimize.
[2024-05-26 19:40:00] [INFO ] Deduced a trap composed of 14 places in 441 ms of which 6 ms to minimize.
[2024-05-26 19:40:00] [INFO ] Deduced a trap composed of 23 places in 429 ms of which 5 ms to minimize.
[2024-05-26 19:40:01] [INFO ] Deduced a trap composed of 23 places in 429 ms of which 6 ms to minimize.
[2024-05-26 19:40:01] [INFO ] Deduced a trap composed of 84 places in 338 ms of which 5 ms to minimize.
[2024-05-26 19:40:01] [INFO ] Deduced a trap composed of 77 places in 449 ms of which 6 ms to minimize.
[2024-05-26 19:40:02] [INFO ] Deduced a trap composed of 67 places in 435 ms of which 5 ms to minimize.
[2024-05-26 19:40:02] [INFO ] Deduced a trap composed of 81 places in 442 ms of which 6 ms to minimize.
[2024-05-26 19:40:03] [INFO ] Deduced a trap composed of 44 places in 440 ms of which 5 ms to minimize.
[2024-05-26 19:40:03] [INFO ] Deduced a trap composed of 23 places in 463 ms of which 5 ms to minimize.
[2024-05-26 19:40:04] [INFO ] Deduced a trap composed of 23 places in 386 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2024-05-26 19:40:05] [INFO ] Deduced a trap composed of 44 places in 463 ms of which 6 ms to minimize.
[2024-05-26 19:40:05] [INFO ] Deduced a trap composed of 21 places in 338 ms of which 5 ms to minimize.
[2024-05-26 19:40:06] [INFO ] Deduced a trap composed of 24 places in 456 ms of which 6 ms to minimize.
[2024-05-26 19:40:06] [INFO ] Deduced a trap composed of 46 places in 380 ms of which 6 ms to minimize.
[2024-05-26 19:40:06] [INFO ] Deduced a trap composed of 43 places in 465 ms of which 5 ms to minimize.
[2024-05-26 19:40:07] [INFO ] Deduced a trap composed of 52 places in 366 ms of which 6 ms to minimize.
[2024-05-26 19:40:07] [INFO ] Deduced a trap composed of 43 places in 277 ms of which 4 ms to minimize.
[2024-05-26 19:40:07] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 3 ms to minimize.
[2024-05-26 19:40:08] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 3 ms to minimize.
[2024-05-26 19:40:08] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2024-05-26 19:40:08] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 4 ms to minimize.
[2024-05-26 19:40:08] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 3 ms to minimize.
[2024-05-26 19:40:08] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 4 ms to minimize.
[2024-05-26 19:40:09] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 3 ms to minimize.
[2024-05-26 19:40:09] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 3 ms to minimize.
[2024-05-26 19:40:09] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 3 ms to minimize.
[2024-05-26 19:40:09] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 4 ms to minimize.
[2024-05-26 19:40:10] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 4 ms to minimize.
[2024-05-26 19:40:10] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 3 ms to minimize.
SMT process timed out in 30821ms, After SMT, problems are : Problem set: 0 solved, 1106 unsolved
Search for dead transitions found 0 dead transitions in 30846ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34225 ms. Remains : 406/406 places, 1113/1113 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[7]
Ending property specific reduction for Peterson-COL-6-UpperBounds-06 in 252866 ms.
Starting property specific reduction for Peterson-COL-6-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2024-05-26 19:40:10] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
// Phase 1: matrix 1239 rows 742 cols
[2024-05-26 19:40:10] [INFO ] Computed 20 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2 resets) in 71 ms. (138 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 63 ms. (156 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2024-05-26 19:40:10] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2024-05-26 19:40:10] [INFO ] Invariant cache hit.
[2024-05-26 19:40:10] [INFO ] [Real]Absence check using 20 positive place invariants in 18 ms returned sat
[2024-05-26 19:40:11] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2024-05-26 19:40:11] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:40:11] [INFO ] [Real]Added 330 Read/Feed constraints in 62 ms returned sat
[2024-05-26 19:40:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:40:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2024-05-26 19:40:12] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2024-05-26 19:40:12] [INFO ] [Nat]Added 330 Read/Feed constraints in 132 ms returned sat
[2024-05-26 19:40:12] [INFO ] Computed and/alt/rep : 1148/3171/1148 causal constraints (skipped 84 transitions) in 98 ms.
[2024-05-26 19:40:13] [INFO ] Added : 70 causal constraints over 14 iterations in 1608 ms. Result :sat
Minimization took 504 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[7]
Support contains 294 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 742 transition count 1442
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 735 transition count 1442
Applied a total of 14 rules in 30 ms. Remains 735 /742 variables (removed 7) and now considering 1442/1449 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 735/742 places, 1442/1449 transitions.
[2024-05-26 19:40:14] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2024-05-26 19:40:14] [INFO ] Computed 20 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 6628 ms. (150 steps per ms)
BEST_FIRST walk for 836130 steps (2 resets) in 5001 ms. (167 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2024-05-26 19:40:26] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:40:26] [INFO ] Invariant cache hit.
[2024-05-26 19:40:26] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2024-05-26 19:40:26] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2024-05-26 19:40:26] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:40:26] [INFO ] [Real]Added 330 Read/Feed constraints in 85 ms returned sat
[2024-05-26 19:40:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:40:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2024-05-26 19:40:27] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2024-05-26 19:40:27] [INFO ] [Nat]Added 330 Read/Feed constraints in 150 ms returned sat
[2024-05-26 19:40:28] [INFO ] Deduced a trap composed of 51 places in 655 ms of which 7 ms to minimize.
[2024-05-26 19:40:28] [INFO ] Deduced a trap composed of 18 places in 640 ms of which 6 ms to minimize.
[2024-05-26 19:40:29] [INFO ] Deduced a trap composed of 12 places in 654 ms of which 7 ms to minimize.
[2024-05-26 19:40:30] [INFO ] Deduced a trap composed of 10 places in 649 ms of which 9 ms to minimize.
[2024-05-26 19:40:31] [INFO ] Deduced a trap composed of 18 places in 730 ms of which 7 ms to minimize.
[2024-05-26 19:40:31] [INFO ] Deduced a trap composed of 51 places in 620 ms of which 7 ms to minimize.
[2024-05-26 19:40:32] [INFO ] Deduced a trap composed of 28 places in 744 ms of which 7 ms to minimize.
[2024-05-26 19:40:33] [INFO ] Deduced a trap composed of 16 places in 593 ms of which 6 ms to minimize.
[2024-05-26 19:40:33] [INFO ] Deduced a trap composed of 32 places in 616 ms of which 9 ms to minimize.
[2024-05-26 19:40:34] [INFO ] Deduced a trap composed of 70 places in 733 ms of which 9 ms to minimize.
[2024-05-26 19:40:35] [INFO ] Deduced a trap composed of 32 places in 492 ms of which 7 ms to minimize.
[2024-05-26 19:40:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 7815 ms
[2024-05-26 19:40:35] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 99 ms.
[2024-05-26 19:40:38] [INFO ] Deduced a trap composed of 52 places in 387 ms of which 6 ms to minimize.
[2024-05-26 19:40:38] [INFO ] Deduced a trap composed of 21 places in 580 ms of which 6 ms to minimize.
[2024-05-26 19:40:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1173 ms
[2024-05-26 19:40:38] [INFO ] Added : 119 causal constraints over 24 iterations in 3557 ms. Result :sat
Minimization took 544 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 32 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 29 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2024-05-26 19:40:39] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:40:39] [INFO ] Invariant cache hit.
[2024-05-26 19:40:40] [INFO ] Implicit Places using invariants in 647 ms returned []
[2024-05-26 19:40:40] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:40:40] [INFO ] Invariant cache hit.
[2024-05-26 19:40:41] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:40:43] [INFO ] Implicit Places using invariants and state equation in 3116 ms returned []
Implicit Place search using SMT with State Equation took 3765 ms to find 0 implicit places.
[2024-05-26 19:40:43] [INFO ] Redundant transitions in 25 ms returned []
Running 1435 sub problems to find dead transitions.
[2024-05-26 19:40:43] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:40:43] [INFO ] Invariant cache hit.
[2024-05-26 19:40:43] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/735 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2024-05-26 19:41:05] [INFO ] Deduced a trap composed of 77 places in 549 ms of which 7 ms to minimize.
[2024-05-26 19:41:05] [INFO ] Deduced a trap composed of 63 places in 522 ms of which 7 ms to minimize.
[2024-05-26 19:41:06] [INFO ] Deduced a trap composed of 16 places in 670 ms of which 6 ms to minimize.
[2024-05-26 19:41:07] [INFO ] Deduced a trap composed of 87 places in 491 ms of which 7 ms to minimize.
[2024-05-26 19:41:07] [INFO ] Deduced a trap composed of 78 places in 509 ms of which 6 ms to minimize.
[2024-05-26 19:41:08] [INFO ] Deduced a trap composed of 82 places in 468 ms of which 5 ms to minimize.
[2024-05-26 19:41:08] [INFO ] Deduced a trap composed of 84 places in 540 ms of which 8 ms to minimize.
[2024-05-26 19:41:09] [INFO ] Deduced a trap composed of 42 places in 568 ms of which 6 ms to minimize.
[2024-05-26 19:41:09] [INFO ] Deduced a trap composed of 50 places in 521 ms of which 7 ms to minimize.
[2024-05-26 19:41:10] [INFO ] Deduced a trap composed of 74 places in 690 ms of which 6 ms to minimize.
[2024-05-26 19:41:11] [INFO ] Deduced a trap composed of 28 places in 541 ms of which 7 ms to minimize.
[2024-05-26 19:41:11] [INFO ] Deduced a trap composed of 45 places in 533 ms of which 6 ms to minimize.
[2024-05-26 19:41:12] [INFO ] Deduced a trap composed of 83 places in 600 ms of which 10 ms to minimize.
[2024-05-26 19:41:12] [INFO ] Deduced a trap composed of 94 places in 618 ms of which 6 ms to minimize.
[2024-05-26 19:41:13] [INFO ] Deduced a trap composed of 36 places in 697 ms of which 6 ms to minimize.
[2024-05-26 19:41:14] [INFO ] Deduced a trap composed of 16 places in 591 ms of which 9 ms to minimize.
[2024-05-26 19:41:14] [INFO ] Deduced a trap composed of 22 places in 565 ms of which 6 ms to minimize.
SMT process timed out in 31022ms, After SMT, problems are : Problem set: 0 solved, 1435 unsolved
Search for dead transitions found 0 dead transitions in 31043ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34869 ms. Remains : 735/735 places, 1442/1442 transitions.
[2024-05-26 19:41:14] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:41:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 7135 ms. (140 steps per ms)
BEST_FIRST walk for 838418 steps (2 resets) in 5001 ms. (167 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2024-05-26 19:41:26] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:41:26] [INFO ] Invariant cache hit.
[2024-05-26 19:41:27] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2024-05-26 19:41:27] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2024-05-26 19:41:27] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:41:27] [INFO ] [Real]Added 330 Read/Feed constraints in 86 ms returned sat
[2024-05-26 19:41:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 19:41:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2024-05-26 19:41:28] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2024-05-26 19:41:28] [INFO ] [Nat]Added 330 Read/Feed constraints in 144 ms returned sat
[2024-05-26 19:41:29] [INFO ] Deduced a trap composed of 51 places in 629 ms of which 8 ms to minimize.
[2024-05-26 19:41:29] [INFO ] Deduced a trap composed of 18 places in 527 ms of which 7 ms to minimize.
[2024-05-26 19:41:30] [INFO ] Deduced a trap composed of 12 places in 590 ms of which 6 ms to minimize.
[2024-05-26 19:41:30] [INFO ] Deduced a trap composed of 10 places in 619 ms of which 10 ms to minimize.
[2024-05-26 19:41:31] [INFO ] Deduced a trap composed of 18 places in 718 ms of which 7 ms to minimize.
[2024-05-26 19:41:32] [INFO ] Deduced a trap composed of 51 places in 619 ms of which 10 ms to minimize.
[2024-05-26 19:41:33] [INFO ] Deduced a trap composed of 28 places in 746 ms of which 6 ms to minimize.
[2024-05-26 19:41:33] [INFO ] Deduced a trap composed of 16 places in 605 ms of which 6 ms to minimize.
[2024-05-26 19:41:34] [INFO ] Deduced a trap composed of 32 places in 693 ms of which 7 ms to minimize.
[2024-05-26 19:41:35] [INFO ] Deduced a trap composed of 70 places in 582 ms of which 6 ms to minimize.
[2024-05-26 19:41:35] [INFO ] Deduced a trap composed of 32 places in 562 ms of which 5 ms to minimize.
[2024-05-26 19:41:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 7560 ms
[2024-05-26 19:41:36] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 100 ms.
[2024-05-26 19:41:38] [INFO ] Deduced a trap composed of 52 places in 388 ms of which 5 ms to minimize.
[2024-05-26 19:41:39] [INFO ] Deduced a trap composed of 21 places in 568 ms of which 7 ms to minimize.
[2024-05-26 19:41:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1189 ms
[2024-05-26 19:41:39] [INFO ] Added : 119 causal constraints over 24 iterations in 3610 ms. Result :sat
Minimization took 612 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 17 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 17 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2024-05-26 19:41:40] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:41:40] [INFO ] Invariant cache hit.
[2024-05-26 19:41:41] [INFO ] Implicit Places using invariants in 636 ms returned []
[2024-05-26 19:41:41] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:41:41] [INFO ] Invariant cache hit.
[2024-05-26 19:41:41] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:41:44] [INFO ] Implicit Places using invariants and state equation in 3103 ms returned []
Implicit Place search using SMT with State Equation took 3741 ms to find 0 implicit places.
[2024-05-26 19:41:44] [INFO ] Redundant transitions in 25 ms returned []
Running 1435 sub problems to find dead transitions.
[2024-05-26 19:41:44] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:41:44] [INFO ] Invariant cache hit.
[2024-05-26 19:41:44] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/735 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2024-05-26 19:42:06] [INFO ] Deduced a trap composed of 77 places in 513 ms of which 6 ms to minimize.
[2024-05-26 19:42:06] [INFO ] Deduced a trap composed of 63 places in 501 ms of which 6 ms to minimize.
[2024-05-26 19:42:07] [INFO ] Deduced a trap composed of 16 places in 510 ms of which 6 ms to minimize.
[2024-05-26 19:42:07] [INFO ] Deduced a trap composed of 87 places in 518 ms of which 5 ms to minimize.
[2024-05-26 19:42:08] [INFO ] Deduced a trap composed of 78 places in 496 ms of which 6 ms to minimize.
[2024-05-26 19:42:08] [INFO ] Deduced a trap composed of 82 places in 559 ms of which 8 ms to minimize.
[2024-05-26 19:42:09] [INFO ] Deduced a trap composed of 84 places in 505 ms of which 5 ms to minimize.
[2024-05-26 19:42:09] [INFO ] Deduced a trap composed of 42 places in 493 ms of which 6 ms to minimize.
[2024-05-26 19:42:10] [INFO ] Deduced a trap composed of 50 places in 621 ms of which 6 ms to minimize.
[2024-05-26 19:42:11] [INFO ] Deduced a trap composed of 74 places in 575 ms of which 6 ms to minimize.
[2024-05-26 19:42:11] [INFO ] Deduced a trap composed of 28 places in 470 ms of which 6 ms to minimize.
[2024-05-26 19:42:12] [INFO ] Deduced a trap composed of 45 places in 520 ms of which 6 ms to minimize.
[2024-05-26 19:42:12] [INFO ] Deduced a trap composed of 83 places in 525 ms of which 6 ms to minimize.
[2024-05-26 19:42:13] [INFO ] Deduced a trap composed of 94 places in 617 ms of which 9 ms to minimize.
[2024-05-26 19:42:13] [INFO ] Deduced a trap composed of 36 places in 562 ms of which 6 ms to minimize.
[2024-05-26 19:42:14] [INFO ] Deduced a trap composed of 16 places in 679 ms of which 6 ms to minimize.
[2024-05-26 19:42:15] [INFO ] Deduced a trap composed of 22 places in 560 ms of which 9 ms to minimize.
SMT process timed out in 30724ms, After SMT, problems are : Problem set: 0 solved, 1435 unsolved
Search for dead transitions found 0 dead transitions in 30743ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34534 ms. Remains : 735/735 places, 1442/1442 transitions.
[2024-05-26 19:42:15] [INFO ] Flatten gal took : 77 ms
[2024-05-26 19:42:15] [INFO ] Flatten gal took : 103 ms
[2024-05-26 19:42:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16338096436425667254.gal : 12 ms
[2024-05-26 19:42:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7201376848617981127.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16338096436425667254.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7201376848617981127.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7201376848617981127.prop.
RANDOM walk for 40000 steps (8 resets) in 1375 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 618 ms. (64 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 454 ms. (87 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 11
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :11 after 17
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :17 after 43
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :43 after 60
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :60 after 194
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :194 after 618
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :618 after 938
Interrupted probabilistic random walk after 241488 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 241488 steps, saw 47065 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-26 19:42:18] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:42:18] [INFO ] Invariant cache hit.
[2024-05-26 19:42:18] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 392/686 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:42:19] [INFO ] Deduced a trap composed of 99 places in 363 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/693 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1232/1925 variables, 693/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1925 variables, 330/1038 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1925 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 42/1967 variables, 42/1080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1967 variables, 6/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1967 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1967 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1967/1967 variables, and 1086 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1569 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 735/735 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 392/686 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:42:20] [INFO ] Deduced a trap composed of 100 places in 287 ms of which 5 ms to minimize.
[2024-05-26 19:42:21] [INFO ] Deduced a trap composed of 175 places in 167 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :938 after 5055
[2024-05-26 19:42:21] [INFO ] Deduced a trap composed of 112 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/686 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/693 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1232/1925 variables, 693/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1925 variables, 330/1041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1925 variables, 2/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1925 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1967 variables, 42/1085 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1967 variables, 6/1091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:42:24] [INFO ] Deduced a trap composed of 32 places in 582 ms of which 7 ms to minimize.
[2024-05-26 19:42:25] [INFO ] Deduced a trap composed of 38 places in 575 ms of which 7 ms to minimize.
[2024-05-26 19:42:26] [INFO ] Deduced a trap composed of 101 places in 591 ms of which 7 ms to minimize.
SMT process timed out in 7232ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 28 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 735/735 places, 1442/1442 transitions.
RANDOM walk for 40000 steps (8 resets) in 1835 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 512 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 453 ms. (88 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5055 after 11764
Interrupted probabilistic random walk after 239856 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 2
Probabilistic random walk after 239856 steps, saw 46892 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-26 19:42:29] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:42:29] [INFO ] Invariant cache hit.
[2024-05-26 19:42:29] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 392/686 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:42:30] [INFO ] Deduced a trap composed of 99 places in 386 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/693 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1232/1925 variables, 693/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1925 variables, 330/1038 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1925 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 42/1967 variables, 42/1080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1967 variables, 6/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1967 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1967 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1967/1967 variables, and 1086 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1598 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 735/735 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 392/686 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:42:32] [INFO ] Deduced a trap composed of 100 places in 279 ms of which 4 ms to minimize.
[2024-05-26 19:42:32] [INFO ] Deduced a trap composed of 175 places in 195 ms of which 4 ms to minimize.
[2024-05-26 19:42:32] [INFO ] Deduced a trap composed of 112 places in 192 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/686 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/693 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1232/1925 variables, 693/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1925 variables, 330/1041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :11764 after 24237
At refinement iteration 9 (INCLUDED_ONLY) 0/1925 variables, 2/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1925 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1967 variables, 42/1085 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1967 variables, 6/1091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:42:35] [INFO ] Deduced a trap composed of 32 places in 622 ms of which 7 ms to minimize.
[2024-05-26 19:42:36] [INFO ] Deduced a trap composed of 38 places in 601 ms of which 7 ms to minimize.
[2024-05-26 19:42:37] [INFO ] Deduced a trap composed of 101 places in 571 ms of which 7 ms to minimize.
[2024-05-26 19:42:37] [INFO ] Deduced a trap composed of 45 places in 597 ms of which 7 ms to minimize.
[2024-05-26 19:42:38] [INFO ] Deduced a trap composed of 22 places in 590 ms of which 7 ms to minimize.
[2024-05-26 19:42:39] [INFO ] Deduced a trap composed of 51 places in 591 ms of which 7 ms to minimize.
[2024-05-26 19:42:40] [INFO ] Deduced a trap composed of 32 places in 585 ms of which 7 ms to minimize.
[2024-05-26 19:42:40] [INFO ] Deduced a trap composed of 28 places in 576 ms of which 7 ms to minimize.
[2024-05-26 19:42:41] [INFO ] Deduced a trap composed of 36 places in 572 ms of which 7 ms to minimize.
[2024-05-26 19:42:42] [INFO ] Deduced a trap composed of 28 places in 564 ms of which 7 ms to minimize.
[2024-05-26 19:42:42] [INFO ] Deduced a trap composed of 34 places in 573 ms of which 7 ms to minimize.
[2024-05-26 19:42:43] [INFO ] Deduced a trap composed of 50 places in 484 ms of which 7 ms to minimize.
[2024-05-26 19:42:44] [INFO ] Deduced a trap composed of 44 places in 573 ms of which 7 ms to minimize.
[2024-05-26 19:42:44] [INFO ] Deduced a trap composed of 26 places in 585 ms of which 8 ms to minimize.
[2024-05-26 19:42:45] [INFO ] Deduced a trap composed of 52 places in 585 ms of which 8 ms to minimize.
[2024-05-26 19:42:46] [INFO ] Deduced a trap composed of 56 places in 573 ms of which 7 ms to minimize.
[2024-05-26 19:42:47] [INFO ] Deduced a trap composed of 70 places in 577 ms of which 7 ms to minimize.
[2024-05-26 19:42:47] [INFO ] Deduced a trap composed of 64 places in 600 ms of which 7 ms to minimize.
[2024-05-26 19:42:48] [INFO ] Deduced a trap composed of 110 places in 576 ms of which 8 ms to minimize.
[2024-05-26 19:42:49] [INFO ] Deduced a trap composed of 42 places in 544 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1967 variables, 20/1111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:42:50] [INFO ] Deduced a trap composed of 82 places in 551 ms of which 7 ms to minimize.
[2024-05-26 19:42:51] [INFO ] Deduced a trap composed of 96 places in 541 ms of which 7 ms to minimize.
[2024-05-26 19:42:51] [INFO ] Deduced a trap composed of 22 places in 564 ms of which 7 ms to minimize.
[2024-05-26 19:42:52] [INFO ] Deduced a trap composed of 50 places in 540 ms of which 6 ms to minimize.
[2024-05-26 19:42:53] [INFO ] Deduced a trap composed of 55 places in 533 ms of which 7 ms to minimize.
[2024-05-26 19:42:53] [INFO ] Deduced a trap composed of 20 places in 563 ms of which 7 ms to minimize.
[2024-05-26 19:42:54] [INFO ] Deduced a trap composed of 68 places in 347 ms of which 5 ms to minimize.
[2024-05-26 19:42:54] [INFO ] Deduced a trap composed of 95 places in 344 ms of which 5 ms to minimize.
[2024-05-26 19:42:55] [INFO ] Deduced a trap composed of 64 places in 339 ms of which 4 ms to minimize.
[2024-05-26 19:42:55] [INFO ] Deduced a trap composed of 90 places in 440 ms of which 5 ms to minimize.
[2024-05-26 19:42:56] [INFO ] Deduced a trap composed of 80 places in 428 ms of which 6 ms to minimize.
[2024-05-26 19:42:57] [INFO ] Deduced a trap composed of 60 places in 426 ms of which 5 ms to minimize.
[2024-05-26 19:42:57] [INFO ] Deduced a trap composed of 85 places in 435 ms of which 6 ms to minimize.
[2024-05-26 19:42:58] [INFO ] Deduced a trap composed of 62 places in 348 ms of which 5 ms to minimize.
[2024-05-26 19:42:59] [INFO ] Deduced a trap composed of 84 places in 352 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :24237 after 134949
[2024-05-26 19:42:59] [INFO ] Deduced a trap composed of 62 places in 348 ms of which 5 ms to minimize.
[2024-05-26 19:43:00] [INFO ] Deduced a trap composed of 84 places in 333 ms of which 4 ms to minimize.
[2024-05-26 19:43:00] [INFO ] Deduced a trap composed of 92 places in 340 ms of which 5 ms to minimize.
[2024-05-26 19:43:00] [INFO ] Deduced a trap composed of 82 places in 340 ms of which 5 ms to minimize.
[2024-05-26 19:43:01] [INFO ] Deduced a trap composed of 98 places in 342 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1967 variables, 20/1131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 19:43:02] [INFO ] Deduced a trap composed of 84 places in 342 ms of which 5 ms to minimize.
[2024-05-26 19:43:03] [INFO ] Deduced a trap composed of 14 places in 570 ms of which 6 ms to minimize.
[2024-05-26 19:43:04] [INFO ] Deduced a trap composed of 28 places in 566 ms of which 7 ms to minimize.
Detected timeout of ITS tools.
[2024-05-26 19:43:05] [INFO ] Deduced a trap composed of 26 places in 571 ms of which 7 ms to minimize.
[2024-05-26 19:43:05] [INFO ] Flatten gal took : 44 ms
[2024-05-26 19:43:05] [INFO ] Applying decomposition
[2024-05-26 19:43:05] [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/graph14095165040583577690.txt' '-o' '/tmp/graph14095165040583577690.bin' '-w' '/tmp/graph14095165040583577690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14095165040583577690.bin' '-l' '-1' '-v' '-w' '/tmp/graph14095165040583577690.weights' '-q' '0' '-e' '0.001'
[2024-05-26 19:43:05] [INFO ] Decomposing Gal with order
[2024-05-26 19:43:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 19:43:06] [INFO ] Removed a total of 1581 redundant transitions.
[2024-05-26 19:43:06] [INFO ] Flatten gal took : 396 ms
[2024-05-26 19:43:06] [INFO ] Deduced a trap composed of 74 places in 462 ms of which 7 ms to minimize.
[2024-05-26 19:43:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 51 ms.
[2024-05-26 19:43:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6274990083853237244.gal : 20 ms
[2024-05-26 19:43:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8455905104557623930.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6274990083853237244.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8455905104557623930.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8455905104557623930.prop.
[2024-05-26 19:43:06] [INFO ] Deduced a trap composed of 60 places in 454 ms of which 6 ms to minimize.
[2024-05-26 19:43:07] [INFO ] Deduced a trap composed of 86 places in 589 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 20
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :20 after 29
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :29 after 38
[2024-05-26 19:43:08] [INFO ] Deduced a trap composed of 53 places in 588 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :38 after 40
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :40 after 92
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 592
[2024-05-26 19:43:09] [INFO ] Deduced a trap composed of 57 places in 600 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :592 after 1267
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1267 after 1702
[2024-05-26 19:43:10] [INFO ] Deduced a trap composed of 87 places in 596 ms of which 7 ms to minimize.
[2024-05-26 19:43:10] [INFO ] Deduced a trap composed of 40 places in 574 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1702 after 2902
[2024-05-26 19:43:11] [INFO ] Deduced a trap composed of 38 places in 590 ms of which 7 ms to minimize.
[2024-05-26 19:43:11] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 4 ms to minimize.
[2024-05-26 19:43:13] [INFO ] Deduced a trap composed of 38 places in 601 ms of which 7 ms to minimize.
[2024-05-26 19:43:13] [INFO ] Deduced a trap composed of 12 places in 602 ms of which 8 ms to minimize.
[2024-05-26 19:43:14] [INFO ] Deduced a trap composed of 56 places in 601 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2902 after 21316
[2024-05-26 19:43:15] [INFO ] Deduced a trap composed of 48 places in 609 ms of which 7 ms to minimize.
[2024-05-26 19:43:16] [INFO ] Deduced a trap composed of 39 places in 597 ms of which 6 ms to minimize.
[2024-05-26 19:43:16] [INFO ] Deduced a trap composed of 75 places in 557 ms of which 7 ms to minimize.
SMT process timed out in 46941ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 366 ms.
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 17 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 20 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2024-05-26 19:43:17] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:43:17] [INFO ] Invariant cache hit.
[2024-05-26 19:43:17] [INFO ] Implicit Places using invariants in 692 ms returned []
[2024-05-26 19:43:17] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:43:17] [INFO ] Invariant cache hit.
[2024-05-26 19:43:18] [INFO ] State equation strengthened by 330 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :21316 after 58054
[2024-05-26 19:43:21] [INFO ] Implicit Places using invariants and state equation in 3282 ms returned []
Implicit Place search using SMT with State Equation took 3975 ms to find 0 implicit places.
[2024-05-26 19:43:21] [INFO ] Redundant transitions in 25 ms returned []
Running 1435 sub problems to find dead transitions.
[2024-05-26 19:43:21] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2024-05-26 19:43:21] [INFO ] Invariant cache hit.
[2024-05-26 19:43:21] [INFO ] State equation strengthened by 330 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :58054 after 112342
At refinement iteration 0 (INCLUDED_ONLY) 0/735 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2024-05-26 19:43:43] [INFO ] Deduced a trap composed of 77 places in 552 ms of which 7 ms to minimize.
[2024-05-26 19:43:44] [INFO ] Deduced a trap composed of 63 places in 497 ms of which 7 ms to minimize.
[2024-05-26 19:43:44] [INFO ] Deduced a trap composed of 16 places in 488 ms of which 6 ms to minimize.
[2024-05-26 19:43:45] [INFO ] Deduced a trap composed of 87 places in 483 ms of which 6 ms to minimize.
[2024-05-26 19:43:45] [INFO ] Deduced a trap composed of 78 places in 492 ms of which 6 ms to minimize.
[2024-05-26 19:43:46] [INFO ] Deduced a trap composed of 82 places in 454 ms of which 5 ms to minimize.
[2024-05-26 19:43:46] [INFO ] Deduced a trap composed of 84 places in 466 ms of which 6 ms to minimize.
[2024-05-26 19:43:47] [INFO ] Deduced a trap composed of 42 places in 451 ms of which 6 ms to minimize.
[2024-05-26 19:43:47] [INFO ] Deduced a trap composed of 50 places in 478 ms of which 6 ms to minimize.
[2024-05-26 19:43:48] [INFO ] Deduced a trap composed of 74 places in 540 ms of which 7 ms to minimize.
[2024-05-26 19:43:48] [INFO ] Deduced a trap composed of 28 places in 510 ms of which 6 ms to minimize.
[2024-05-26 19:43:49] [INFO ] Deduced a trap composed of 45 places in 518 ms of which 7 ms to minimize.
[2024-05-26 19:43:49] [INFO ] Deduced a trap composed of 83 places in 531 ms of which 6 ms to minimize.
[2024-05-26 19:43:50] [INFO ] Deduced a trap composed of 94 places in 531 ms of which 6 ms to minimize.
[2024-05-26 19:43:50] [INFO ] Deduced a trap composed of 36 places in 511 ms of which 6 ms to minimize.
[2024-05-26 19:43:51] [INFO ] Deduced a trap composed of 16 places in 509 ms of which 7 ms to minimize.
[2024-05-26 19:43:51] [INFO ] Deduced a trap composed of 22 places in 492 ms of which 7 ms to minimize.
SMT process timed out in 30671ms, After SMT, problems are : Problem set: 0 solved, 1435 unsolved
Search for dead transitions found 0 dead transitions in 30689ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34719 ms. Remains : 735/735 places, 1442/1442 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 588 edges and 735 vertex of which 72 / 735 are part of one of the 36 SCC in 5 ms
Free SCC test removed 36 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 282 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 33 rules applied. Total rules applied 34 place count 679 transition count 1219
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 48 place count 672 transition count 1212
Graph (trivial) has 336 edges and 672 vertex of which 78 / 672 are part of one of the 7 SCC in 0 ms
Free SCC test removed 71 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 601 transition count 1212
Drop transitions (Empty/Sink Transition effects.) removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 127 place count 601 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 1 with 102 rules applied. Total rules applied 229 place count 601 transition count 1032
Graph (complete) has 1074 edges and 601 vertex of which 559 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 230 place count 559 transition count 1032
Drop transitions (Empty/Sink Transition effects.) removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 482 place count 559 transition count 780
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 488 place count 559 transition count 774
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 494 place count 553 transition count 774
Partial Post-agglomeration rule applied 180 times.
Drop transitions (Partial Post agglomeration) removed 180 transitions
Iterating global reduction 4 with 180 rules applied. Total rules applied 674 place count 553 transition count 774
Applied a total of 674 rules in 185 ms. Remains 553 /735 variables (removed 182) and now considering 774/1442 (removed 668) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 774 rows 553 cols
[2024-05-26 19:43:52] [INFO ] Computed 7 invariants in 3 ms
[2024-05-26 19:43:52] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-05-26 19:43:53] [INFO ] After 1114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 19:43:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-05-26 19:43:54] [INFO ] After 1071ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-26 19:43:55] [INFO ] After 1801ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-26 19:43:55] [INFO ] After 2635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-26 19:43:56] [INFO ] Flatten gal took : 15 ms
[2024-05-26 19:43:56] [INFO ] Flatten gal took : 14 ms
[2024-05-26 19:43:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17633600906977326399.gal : 4 ms
[2024-05-26 19:43:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8793585009952733689.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17633600906977326399.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8793585009952733689.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8793585009952733689.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 43
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :43 after 75
Detected timeout of ITS tools.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :75 after 5214
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5214 after 493039
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :493039 after 2.27702e+11
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.92039e+13,3.60438,26212,2,1100,14,14017,8,0,2991,7815,0
Total reachable state count : 19203908986159
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,5.07862,26212,2,554,14,14017,8,0,11167,7815,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,6.6894,26212,2,554,14,14017,8,0,19342,7815,0
Over-approximation ignoring read arcs solved 0 properties in 10795 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[6] Max Struct:[7]
Ending property specific reduction for Peterson-COL-6-UpperBounds-08 in 232192 ms.
[2024-05-26 19:44:02] [INFO ] Flatten gal took : 38 ms
[2024-05-26 19:44:02] [INFO ] Applying decomposition
[2024-05-26 19:44:02] [INFO ] Flatten gal took : 39 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/graph6526805747855179587.txt' '-o' '/tmp/graph6526805747855179587.bin' '-w' '/tmp/graph6526805747855179587.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6526805747855179587.bin' '-l' '-1' '-v' '-w' '/tmp/graph6526805747855179587.weights' '-q' '0' '-e' '0.001'
[2024-05-26 19:44:02] [INFO ] Decomposing Gal with order
[2024-05-26 19:44:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 19:44:03] [INFO ] Removed a total of 2000 redundant transitions.
[2024-05-26 19:44:03] [INFO ] Flatten gal took : 84 ms
[2024-05-26 19:44:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 43 ms.
[2024-05-26 19:44:03] [INFO ] Time to serialize gal into /tmp/UpperBounds10015426193312475960.gal : 14 ms
[2024-05-26 19:44:03] [INFO ] Time to serialize properties into /tmp/UpperBounds7044950622206887679.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10015426193312475960.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7044950622206887679.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds7044950622206887679.prop.
ITS-tools command line returned an error code 137
[2024-05-26 19:55:01] [INFO ] Applying decomposition
[2024-05-26 19:55:01] [INFO ] Flatten gal took : 40 ms
[2024-05-26 19:55:01] [INFO ] Decomposing Gal with order
[2024-05-26 19:55:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 19:55:02] [INFO ] Removed a total of 2121 redundant transitions.
[2024-05-26 19:55:02] [INFO ] Flatten gal took : 83 ms
[2024-05-26 19:55:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-26 19:55:02] [INFO ] Time to serialize gal into /tmp/UpperBounds2526720391997989385.gal : 13 ms
[2024-05-26 19:55:02] [INFO ] Time to serialize properties into /tmp/UpperBounds896345207712016346.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2526720391997989385.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds896345207712016346.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...303
Loading property file /tmp/UpperBounds896345207712016346.prop.
ITS-tools command line returned an error code 137
[2024-05-26 20:05:59] [INFO ] Flatten gal took : 40 ms
[2024-05-26 20:05:59] [INFO ] Input system was already deterministic with 1449 transitions.
[2024-05-26 20:05:59] [INFO ] Transformed 742 places.
[2024-05-26 20:05:59] [INFO ] Transformed 1449 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-26 20:05:59] [INFO ] Time to serialize gal into /tmp/UpperBounds3279066804252842915.gal : 6 ms
[2024-05-26 20:05:59] [INFO ] Time to serialize properties into /tmp/UpperBounds10835994393410254348.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3279066804252842915.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10835994393410254348.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10835994393410254348.prop.
ITS-tools command line returned an error code 137
Total runtime 3188031 ms.
BK_STOP 1716754743706
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-6"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Peterson-COL-6, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654407200237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;