About the Execution of ITS-Tools for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9678.855 | 3600000.00 | 3726888.00 | 7962.50 | ? ? ? ? 1 ? ? ? ? ? ? ? ? ? 1 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110000205.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000205
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.5K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 340K May 10 09:33 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 DoubleExponent-PT-020-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652646683850
Running Version 202205111006
[2022-05-15 20:31:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 20:31:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:31:25] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2022-05-15 20:31:25] [INFO ] Transformed 1064 places.
[2022-05-15 20:31:25] [INFO ] Transformed 998 transitions.
[2022-05-15 20:31:25] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 240 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 998 rows 1064 cols
[2022-05-15 20:31:25] [INFO ] Invariants computation overflowed in 163 ms
Incomplete random walk after 10000 steps, including 328 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :0
// Phase 1: matrix 998 rows 1064 cols
[2022-05-15 20:31:26] [INFO ] Invariants computation overflowed in 117 ms
[2022-05-15 20:31:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:31:26] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2022-05-15 20:31:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:31:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:31:27] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2022-05-15 20:31:27] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 73 ms.
[2022-05-15 20:31:31] [INFO ] Added : 20 causal constraints over 4 iterations in 4145 ms. Result :sat
Minimization took 310 ms.
[2022-05-15 20:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:31:32] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2022-05-15 20:31:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:31:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:31:32] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2022-05-15 20:31:33] [INFO ] Deduced a trap composed of 385 places in 329 ms of which 5 ms to minimize.
[2022-05-15 20:31:33] [INFO ] Deduced a trap composed of 53 places in 360 ms of which 3 ms to minimize.
[2022-05-15 20:31:33] [INFO ] Deduced a trap composed of 55 places in 318 ms of which 1 ms to minimize.
[2022-05-15 20:31:34] [INFO ] Deduced a trap composed of 392 places in 345 ms of which 2 ms to minimize.
[2022-05-15 20:31:34] [INFO ] Deduced a trap composed of 373 places in 326 ms of which 1 ms to minimize.
[2022-05-15 20:31:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2281 ms
[2022-05-15 20:31:34] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 54 ms.
[2022-05-15 20:31:37] [INFO ] Added : 20 causal constraints over 4 iterations in 2333 ms. Result :unknown
[2022-05-15 20:31:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:31:38] [INFO ] [Real]Absence check using state equation in 1051 ms returned sat
[2022-05-15 20:31:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:31:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:31:39] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2022-05-15 20:31:39] [INFO ] Deduced a trap composed of 108 places in 219 ms of which 1 ms to minimize.
[2022-05-15 20:31:40] [INFO ] Deduced a trap composed of 156 places in 180 ms of which 1 ms to minimize.
[2022-05-15 20:31:40] [INFO ] Deduced a trap composed of 219 places in 186 ms of which 1 ms to minimize.
[2022-05-15 20:31:40] [INFO ] Deduced a trap composed of 161 places in 178 ms of which 1 ms to minimize.
[2022-05-15 20:31:40] [INFO ] Deduced a trap composed of 163 places in 185 ms of which 1 ms to minimize.
[2022-05-15 20:31:41] [INFO ] Deduced a trap composed of 149 places in 176 ms of which 1 ms to minimize.
[2022-05-15 20:31:41] [INFO ] Deduced a trap composed of 173 places in 179 ms of which 0 ms to minimize.
[2022-05-15 20:31:41] [INFO ] Deduced a trap composed of 187 places in 174 ms of which 1 ms to minimize.
[2022-05-15 20:31:41] [INFO ] Deduced a trap composed of 175 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:31:41] [INFO ] Deduced a trap composed of 185 places in 163 ms of which 1 ms to minimize.
[2022-05-15 20:31:42] [INFO ] Deduced a trap composed of 211 places in 148 ms of which 1 ms to minimize.
[2022-05-15 20:31:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2513 ms
[2022-05-15 20:31:42] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 50 ms.
[2022-05-15 20:31:43] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 20:31:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:31:43] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2022-05-15 20:31:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:31:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:31:44] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2022-05-15 20:31:44] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 56 ms.
[2022-05-15 20:31:48] [INFO ] Added : 20 causal constraints over 4 iterations in 3462 ms. Result :sat
Minimization took 1017 ms.
[2022-05-15 20:31:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:31:52] [INFO ] [Real]Absence check using state equation in 3213 ms returned unsat
[2022-05-15 20:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:31:54] [INFO ] [Real]Absence check using state equation in 1665 ms returned sat
[2022-05-15 20:31:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:31:56] [INFO ] [Nat]Absence check using state equation in 2144 ms returned sat
[2022-05-15 20:31:56] [INFO ] Deduced a trap composed of 407 places in 331 ms of which 1 ms to minimize.
[2022-05-15 20:31:57] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 1 ms to minimize.
[2022-05-15 20:31:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 758 ms
[2022-05-15 20:31:57] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 58 ms.
[2022-05-15 20:31:59] [INFO ] Added : 20 causal constraints over 4 iterations in 2011 ms. Result :unknown
[2022-05-15 20:31:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:02] [INFO ] [Real]Absence check using state equation in 3524 ms returned sat
[2022-05-15 20:32:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:32:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:06] [INFO ] [Nat]Absence check using state equation in 3553 ms returned sat
[2022-05-15 20:32:06] [INFO ] Deduced a trap composed of 38 places in 310 ms of which 0 ms to minimize.
[2022-05-15 20:32:07] [INFO ] Deduced a trap composed of 113 places in 298 ms of which 1 ms to minimize.
[2022-05-15 20:32:07] [INFO ] Deduced a trap composed of 26 places in 323 ms of which 1 ms to minimize.
[2022-05-15 20:32:08] [INFO ] Deduced a trap composed of 36 places in 318 ms of which 1 ms to minimize.
[2022-05-15 20:32:08] [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 6
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 20:32:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:08] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2022-05-15 20:32:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:32:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:09] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2022-05-15 20:32:09] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 1 ms to minimize.
[2022-05-15 20:32:10] [INFO ] Deduced a trap composed of 43 places in 267 ms of which 1 ms to minimize.
[2022-05-15 20:32:10] [INFO ] Deduced a trap composed of 115 places in 263 ms of which 1 ms to minimize.
[2022-05-15 20:32:10] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 0 ms to minimize.
[2022-05-15 20:32:11] [INFO ] Deduced a trap composed of 18 places in 266 ms of which 1 ms to minimize.
[2022-05-15 20:32:11] [INFO ] Deduced a trap composed of 101 places in 213 ms of which 1 ms to minimize.
[2022-05-15 20:32:11] [INFO ] Deduced a trap composed of 89 places in 214 ms of which 1 ms to minimize.
[2022-05-15 20:32:11] [INFO ] Deduced a trap composed of 113 places in 208 ms of which 1 ms to minimize.
[2022-05-15 20:32:12] [INFO ] Deduced a trap composed of 185 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:32:12] [INFO ] Deduced a trap composed of 191 places in 186 ms of which 0 ms to minimize.
[2022-05-15 20:32:12] [INFO ] Deduced a trap composed of 187 places in 170 ms of which 0 ms to minimize.
[2022-05-15 20:32:12] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3123 ms
[2022-05-15 20:32:12] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 46 ms.
[2022-05-15 20:32:13] [INFO ] Added : 75 causal constraints over 15 iterations in 1215 ms. Result :unknown
[2022-05-15 20:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:14] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2022-05-15 20:32:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:32:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:14] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2022-05-15 20:32:15] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 55 ms.
[2022-05-15 20:32:19] [INFO ] Added : 55 causal constraints over 11 iterations in 4492 ms. Result :unknown
[2022-05-15 20:32:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:21] [INFO ] [Real]Absence check using state equation in 2419 ms returned sat
[2022-05-15 20:32:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:32:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:26] [INFO ] [Nat]Absence check using state equation in 4118 ms returned sat
[2022-05-15 20:32:26] [INFO ] Deduced a trap composed of 53 places in 303 ms of which 1 ms to minimize.
[2022-05-15 20:32:26] [INFO ] Deduced a trap composed of 55 places in 298 ms of which 1 ms to minimize.
[2022-05-15 20:32:27] [INFO ] Deduced a trap composed of 161 places in 296 ms of which 0 ms to minimize.
[2022-05-15 20:32:27] [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 9
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 20:32:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:29] [INFO ] [Real]Absence check using state equation in 2439 ms returned sat
[2022-05-15 20:32:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:32:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:31] [INFO ] [Nat]Absence check using state equation in 1333 ms returned sat
[2022-05-15 20:32:31] [INFO ] Deduced a trap composed of 43 places in 256 ms of which 1 ms to minimize.
[2022-05-15 20:32:31] [INFO ] Deduced a trap composed of 41 places in 259 ms of which 1 ms to minimize.
[2022-05-15 20:32:32] [INFO ] Deduced a trap composed of 163 places in 189 ms of which 0 ms to minimize.
[2022-05-15 20:32:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 928 ms
[2022-05-15 20:32:32] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 51 ms.
[2022-05-15 20:32:34] [INFO ] Added : 20 causal constraints over 4 iterations in 2637 ms. Result :unknown
[2022-05-15 20:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:38] [INFO ] [Real]Absence check using state equation in 3758 ms returned unknown
[2022-05-15 20:32:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:43] [INFO ] [Real]Absence check using state equation in 4910 ms returned unknown
[2022-05-15 20:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:48] [INFO ] [Real]Absence check using state equation in 4540 ms returned sat
[2022-05-15 20:32:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:32:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:53] [INFO ] [Nat]Absence check using state equation in 4510 ms returned sat
[2022-05-15 20:32:53] [INFO ] Deduced a trap composed of 29 places in 299 ms of which 1 ms to minimize.
[2022-05-15 20:32:53] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 1 ms to minimize.
[2022-05-15 20:32: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 13
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 20:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:54] [INFO ] [Real]Absence check using state equation in 242 ms returned unsat
[2022-05-15 20:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:56] [INFO ] [Real]Absence check using state equation in 2493 ms returned sat
[2022-05-15 20:32:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:32:59] [INFO ] [Nat]Absence check using state equation in 2580 ms returned sat
[2022-05-15 20:32:59] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 51 ms.
[2022-05-15 20:33:01] [INFO ] Added : 20 causal constraints over 4 iterations in 2260 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1] Max seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA DoubleExponent-PT-020-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-020-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 14 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1058 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 229 rules applied. Total rules applied 230 place count 1057 transition count 770
Reduce places removed 226 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 231 rules applied. Total rules applied 461 place count 831 transition count 765
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 466 place count 826 transition count 765
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 466 place count 826 transition count 725
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 546 place count 786 transition count 725
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 3 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 902 place count 608 transition count 547
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 974 place count 572 transition count 547
Free-agglomeration rule (complex) applied 81 times.
Iterating global reduction 3 with 81 rules applied. Total rules applied 1055 place count 572 transition count 466
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 3 with 81 rules applied. Total rules applied 1136 place count 491 transition count 466
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1216 place count 491 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1217 place count 490 transition count 465
Applied a total of 1217 rules in 287 ms. Remains 490 /1064 variables (removed 574) and now considering 465/998 (removed 533) transitions.
Finished structural reductions, in 1 iterations. Remains : 490/1064 places, 465/998 transitions.
// Phase 1: matrix 465 rows 490 cols
[2022-05-15 20:34:05] [INFO ] Computed 100 place invariants in 82 ms
Incomplete random walk after 1000000 steps, including 128189 resets, run finished after 1014 ms. (steps per millisecond=986 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84779 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84678 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84878 resets, run finished after 649 ms. (steps per millisecond=1540 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85017 resets, run finished after 651 ms. (steps per millisecond=1536 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84533 resets, run finished after 647 ms. (steps per millisecond=1545 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84365 resets, run finished after 651 ms. (steps per millisecond=1536 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84656 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84722 resets, run finished after 659 ms. (steps per millisecond=1517 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84996 resets, run finished after 658 ms. (steps per millisecond=1519 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84598 resets, run finished after 663 ms. (steps per millisecond=1508 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84758 resets, run finished after 663 ms. (steps per millisecond=1508 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84598 resets, run finished after 663 ms. (steps per millisecond=1508 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84980 resets, run finished after 669 ms. (steps per millisecond=1494 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84983 resets, run finished after 661 ms. (steps per millisecond=1512 ) properties (out of 14) seen :0
// Phase 1: matrix 465 rows 490 cols
[2022-05-15 20:34:16] [INFO ] Computed 100 place invariants in 83 ms
[2022-05-15 20:34:16] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:34:16] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-15 20:34:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:34:16] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2022-05-15 20:34:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:34:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-05-15 20:34:16] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-15 20:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:34:16] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2022-05-15 20:34:16] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:34:17] [INFO ] [Nat]Added 73 Read/Feed constraints in 185 ms returned sat
[2022-05-15 20:34:17] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2022-05-15 20:34:17] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 33 ms.
[2022-05-15 20:34:19] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 1 ms to minimize.
[2022-05-15 20:34:19] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 2 ms to minimize.
[2022-05-15 20:34:19] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2022-05-15 20:34:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 646 ms
[2022-05-15 20:34:19] [INFO ] Added : 136 causal constraints over 28 iterations in 2388 ms. Result :sat
Minimization took 616 ms.
[2022-05-15 20:34:20] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:34:20] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-15 20:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:34:20] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-05-15 20:34:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:34:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:34:20] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-15 20:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:34:20] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-05-15 20:34:20] [INFO ] [Nat]Added 73 Read/Feed constraints in 47 ms returned sat
[2022-05-15 20:34:20] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 34 ms.
[2022-05-15 20:34:22] [INFO ] Added : 120 causal constraints over 24 iterations in 1586 ms. Result :sat
Minimization took 904 ms.
[2022-05-15 20:34:23] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:34:23] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-15 20:34:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:34:23] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-15 20:34:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:34:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 20:34:23] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 23 ms returned sat
[2022-05-15 20:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:34:24] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2022-05-15 20:34:24] [INFO ] [Nat]Added 73 Read/Feed constraints in 539 ms returned sat
[2022-05-15 20:34:24] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2022-05-15 20:34:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-15 20:34:24] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 36 ms.
[2022-05-15 20:34:30] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2022-05-15 20:34:31] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2022-05-15 20:34:31] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:34:31] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:34:31] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:34:31] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 0 ms to minimize.
[2022-05-15 20:34:31] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2022-05-15 20:34:31] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2022-05-15 20:34:32] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2022-05-15 20:34:32] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2022-05-15 20:34:32] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 5 ms to minimize.
[2022-05-15 20:34:32] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 0 ms to minimize.
[2022-05-15 20:34:32] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2022-05-15 20:34:33] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 0 ms to minimize.
[2022-05-15 20:34:33] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2022-05-15 20:34:33] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2022-05-15 20:34:33] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2022-05-15 20:34:33] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2022-05-15 20:34:33] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 2 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 0 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2022-05-15 20:34:35] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2022-05-15 20:34:35] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2022-05-15 20:34:35] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 0 ms to minimize.
[2022-05-15 20:34:35] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 0 ms to minimize.
[2022-05-15 20:34:35] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4690 ms
[2022-05-15 20:34:35] [INFO ] Added : 273 causal constraints over 55 iterations in 10781 ms. Result :sat
Minimization took 1557 ms.
[2022-05-15 20:34:37] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:34:37] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 27 ms returned sat
[2022-05-15 20:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:34:37] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2022-05-15 20:34:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:34:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:34:37] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-15 20:34:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:34:37] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2022-05-15 20:34:37] [INFO ] [Nat]Added 73 Read/Feed constraints in 136 ms returned sat
[2022-05-15 20:34:37] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 37 ms.
[2022-05-15 20:34:38] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2022-05-15 20:34:38] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 0 ms to minimize.
[2022-05-15 20:34:39] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 0 ms to minimize.
[2022-05-15 20:34:39] [INFO ] Deduced a trap composed of 126 places in 247 ms of which 1 ms to minimize.
[2022-05-15 20:34:39] [INFO ] Deduced a trap composed of 126 places in 241 ms of which 1 ms to minimize.
[2022-05-15 20:34:40] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 1 ms to minimize.
[2022-05-15 20:34:41] [INFO ] Deduced a trap composed of 122 places in 246 ms of which 1 ms to minimize.
[2022-05-15 20:34:41] [INFO ] Deduced a trap composed of 128 places in 240 ms of which 0 ms to minimize.
[2022-05-15 20:34:42] [INFO ] Deduced a trap composed of 130 places in 236 ms of which 0 ms to minimize.
[2022-05-15 20:34:43] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 0 ms to minimize.
[2022-05-15 20:34:44] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 1 ms to minimize.
[2022-05-15 20:34:45] [INFO ] Deduced a trap composed of 123 places in 242 ms of which 0 ms to minimize.
[2022-05-15 20:34:45] [INFO ] Deduced a trap composed of 124 places in 225 ms of which 0 ms to minimize.
[2022-05-15 20:34:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 7284 ms
[2022-05-15 20:34:45] [INFO ] Added : 58 causal constraints over 13 iterations in 7845 ms. Result :sat
Minimization took 2253 ms.
[2022-05-15 20:34:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 20:34:48] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-15 20:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:34:48] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-15 20:34:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:34:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-05-15 20:34:48] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 22 ms returned sat
[2022-05-15 20:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:34:48] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-05-15 20:34:48] [INFO ] [Nat]Added 73 Read/Feed constraints in 369 ms returned sat
[2022-05-15 20:34:49] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 32 ms.
[2022-05-15 20:34:50] [INFO ] Added : 87 causal constraints over 19 iterations in 1192 ms. Result :sat
Minimization took 974 ms.
[2022-05-15 20:34:51] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 20:34:51] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 38 ms returned sat
[2022-05-15 20:34:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:34:51] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2022-05-15 20:34:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:34:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 20:34:51] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-15 20:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:34:51] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2022-05-15 20:34:52] [INFO ] [Nat]Added 73 Read/Feed constraints in 648 ms returned sat
[2022-05-15 20:34:52] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2022-05-15 20:34:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-15 20:34:52] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 34 ms.
[2022-05-15 20:34:58] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2022-05-15 20:34:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2022-05-15 20:34:58] [INFO ] Added : 284 causal constraints over 57 iterations in 5673 ms. Result :sat
Minimization took 2619 ms.
[2022-05-15 20:35:00] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 20:35:00] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 23 ms returned sat
[2022-05-15 20:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:35:01] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2022-05-15 20:35:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:35:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 20:35:01] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-15 20:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:35:01] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2022-05-15 20:35:02] [INFO ] [Nat]Added 73 Read/Feed constraints in 943 ms returned sat
[2022-05-15 20:35:02] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 33 ms.
[2022-05-15 20:35:10] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2022-05-15 20:35:11] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2022-05-15 20:35:11] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2022-05-15 20:35:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 663 ms
[2022-05-15 20:35:11] [INFO ] Added : 316 causal constraints over 64 iterations in 9113 ms. Result :sat
Minimization took 2798 ms.
[2022-05-15 20:35:14] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:35:14] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-15 20:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:35:14] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2022-05-15 20:35:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:35:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:35:14] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-15 20:35:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:35:14] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2022-05-15 20:35:15] [INFO ] [Nat]Added 73 Read/Feed constraints in 331 ms returned sat
[2022-05-15 20:35:15] [INFO ] Deduced a trap composed of 136 places in 241 ms of which 1 ms to minimize.
[2022-05-15 20:35:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2022-05-15 20:35:15] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 26 ms.
[2022-05-15 20:35:17] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 0 ms to minimize.
[2022-05-15 20:35:17] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 0 ms to minimize.
[2022-05-15 20:35:17] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 0 ms to minimize.
[2022-05-15 20:35:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 691 ms
[2022-05-15 20:35:18] [INFO ] Added : 125 causal constraints over 26 iterations in 2503 ms. Result :sat
Minimization took 821 ms.
[2022-05-15 20:35:18] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:35:19] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-15 20:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:35:19] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2022-05-15 20:35:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:35:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 20:35:19] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-15 20:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:35:19] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2022-05-15 20:35:19] [INFO ] [Nat]Added 73 Read/Feed constraints in 342 ms returned sat
[2022-05-15 20:35:20] [INFO ] Deduced a trap composed of 134 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:35:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2022-05-15 20:35:20] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 27 ms.
[2022-05-15 20:35:24] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 1 ms to minimize.
[2022-05-15 20:35:24] [INFO ] Deduced a trap composed of 151 places in 215 ms of which 1 ms to minimize.
[2022-05-15 20:35:25] [INFO ] Deduced a trap composed of 144 places in 212 ms of which 0 ms to minimize.
[2022-05-15 20:35:25] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 0 ms to minimize.
[2022-05-15 20:35:25] [INFO ] Deduced a trap composed of 149 places in 209 ms of which 1 ms to minimize.
[2022-05-15 20:35:25] [INFO ] Deduced a trap composed of 148 places in 203 ms of which 1 ms to minimize.
[2022-05-15 20:35:26] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2022-05-15 20:35:26] [INFO ] Deduced a trap composed of 150 places in 206 ms of which 0 ms to minimize.
[2022-05-15 20:35:26] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 0 ms to minimize.
[2022-05-15 20:35:26] [INFO ] Deduced a trap composed of 163 places in 211 ms of which 0 ms to minimize.
[2022-05-15 20:35:27] [INFO ] Deduced a trap composed of 140 places in 209 ms of which 0 ms to minimize.
[2022-05-15 20:35:27] [INFO ] Deduced a trap composed of 141 places in 214 ms of which 1 ms to minimize.
[2022-05-15 20:35:27] [INFO ] Deduced a trap composed of 144 places in 198 ms of which 1 ms to minimize.
[2022-05-15 20:35:27] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 1 ms to minimize.
[2022-05-15 20:35:28] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 1 ms to minimize.
[2022-05-15 20:35:28] [INFO ] Deduced a trap composed of 159 places in 209 ms of which 1 ms to minimize.
[2022-05-15 20:35:28] [INFO ] Deduced a trap composed of 142 places in 239 ms of which 1 ms to minimize.
[2022-05-15 20:35:29] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2022-05-15 20:35:29] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 1 ms to minimize.
[2022-05-15 20:35:29] [INFO ] Deduced a trap composed of 141 places in 204 ms of which 1 ms to minimize.
[2022-05-15 20:35:29] [INFO ] Deduced a trap composed of 167 places in 198 ms of which 0 ms to minimize.
[2022-05-15 20:35:30] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 0 ms to minimize.
[2022-05-15 20:35:30] [INFO ] Deduced a trap composed of 140 places in 216 ms of which 1 ms to minimize.
[2022-05-15 20:35:30] [INFO ] Deduced a trap composed of 143 places in 206 ms of which 0 ms to minimize.
[2022-05-15 20:35:30] [INFO ] Deduced a trap composed of 149 places in 205 ms of which 1 ms to minimize.
[2022-05-15 20:35:31] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 1 ms to minimize.
[2022-05-15 20:35:31] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 0 ms to minimize.
[2022-05-15 20:35:32] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 1 ms to minimize.
[2022-05-15 20:35:32] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 0 ms to minimize.
[2022-05-15 20:35:32] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 0 ms to minimize.
[2022-05-15 20:35:32] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 1 ms to minimize.
[2022-05-15 20:35:32] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:35:33] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 0 ms to minimize.
[2022-05-15 20:35:33] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:35:34] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2022-05-15 20:35:35] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:35:35] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 0 ms to minimize.
[2022-05-15 20:35:35] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 0 ms to minimize.
[2022-05-15 20:35:35] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2022-05-15 20:35:35] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 11469 ms
[2022-05-15 20:35:36] [INFO ] Added : 213 causal constraints over 43 iterations in 15991 ms. Result :sat
Minimization took 3001 ms.
[2022-05-15 20:35:39] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 20:35:39] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 23 ms returned sat
[2022-05-15 20:35:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:35:39] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2022-05-15 20:35:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:35:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 20:35:39] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-15 20:35:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:35:39] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2022-05-15 20:35:39] [INFO ] [Nat]Added 73 Read/Feed constraints in 303 ms returned sat
[2022-05-15 20:35:39] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 29 ms.
[2022-05-15 20:35:43] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2022-05-15 20:35:43] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2022-05-15 20:35:43] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 1 ms to minimize.
[2022-05-15 20:35:43] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:35:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 805 ms
[2022-05-15 20:35:43] [INFO ] Added : 198 causal constraints over 40 iterations in 3887 ms. Result :sat
Minimization took 2749 ms.
[2022-05-15 20:35:46] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:35:46] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-15 20:35:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:35:46] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2022-05-15 20:35:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:35:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 20:35:47] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-15 20:35:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:35:47] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2022-05-15 20:35:47] [INFO ] [Nat]Added 73 Read/Feed constraints in 319 ms returned sat
[2022-05-15 20:35:47] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 29 ms.
[2022-05-15 20:35:50] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2022-05-15 20:35:50] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 0 ms to minimize.
[2022-05-15 20:35:50] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2022-05-15 20:35:51] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2022-05-15 20:35:51] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
[2022-05-15 20:35:51] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2022-05-15 20:35:51] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2022-05-15 20:35:51] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
[2022-05-15 20:35:51] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2022-05-15 20:35:52] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2022-05-15 20:35:52] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2022-05-15 20:35:52] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2022-05-15 20:35:52] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2022-05-15 20:35:52] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2453 ms
[2022-05-15 20:35:52] [INFO ] Added : 199 causal constraints over 40 iterations in 5243 ms. Result :sat
Minimization took 1646 ms.
[2022-05-15 20:35:54] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:35:54] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-15 20:35:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:35:54] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2022-05-15 20:35:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:35:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:35:54] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-15 20:35:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:35:55] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2022-05-15 20:35:55] [INFO ] [Nat]Added 73 Read/Feed constraints in 766 ms returned sat
[2022-05-15 20:35:55] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 32 ms.
[2022-05-15 20:36:03] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2022-05-15 20:36:03] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 0 ms to minimize.
[2022-05-15 20:36:03] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 0 ms to minimize.
[2022-05-15 20:36:03] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 0 ms to minimize.
[2022-05-15 20:36:04] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 0 ms to minimize.
[2022-05-15 20:36:04] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 0 ms to minimize.
[2022-05-15 20:36:04] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2022-05-15 20:36:04] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 1 ms to minimize.
[2022-05-15 20:36:04] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 0 ms to minimize.
[2022-05-15 20:36:04] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2022-05-15 20:36:05] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2022-05-15 20:36:05] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 0 ms to minimize.
[2022-05-15 20:36:05] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2036 ms
[2022-05-15 20:36:05] [INFO ] Added : 315 causal constraints over 64 iterations in 9427 ms. Result :sat
Minimization took 1431 ms.
[2022-05-15 20:36:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 20:36:06] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2022-05-15 20:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:36:07] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2022-05-15 20:36:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:36:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:36:07] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-15 20:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:36:07] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2022-05-15 20:36:08] [INFO ] [Nat]Added 73 Read/Feed constraints in 1000 ms returned sat
[2022-05-15 20:36:08] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 34 ms.
[2022-05-15 20:36:13] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2022-05-15 20:36:14] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2022-05-15 20:36:14] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2022-05-15 20:36:14] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2022-05-15 20:36:14] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2022-05-15 20:36:14] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2022-05-15 20:36:15] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2022-05-15 20:36:15] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:36:15] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2022-05-15 20:36:16] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:36:16] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2022-05-15 20:36:16] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 0 ms to minimize.
[2022-05-15 20:36:16] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2022-05-15 20:36:16] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 0 ms to minimize.
[2022-05-15 20:36:17] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 0 ms to minimize.
[2022-05-15 20:36:17] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:36:17] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 0 ms to minimize.
[2022-05-15 20:36:17] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2022-05-15 20:36:17] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 0 ms to minimize.
[2022-05-15 20:36:18] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2022-05-15 20:36:18] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2022-05-15 20:36:18] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2022-05-15 20:36:18] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2022-05-15 20:36:19] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2022-05-15 20:36:19] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2022-05-15 20:36:19] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2022-05-15 20:36:19] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2022-05-15 20:36:19] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-05-15 20:36:20] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2022-05-15 20:36:20] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:36:20] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2022-05-15 20:36:20] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:36:20] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2022-05-15 20:36:21] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2022-05-15 20:36:21] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:36:21] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 0 ms to minimize.
[2022-05-15 20:36:21] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 0 ms to minimize.
[2022-05-15 20:36:21] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 7751 ms
[2022-05-15 20:36:21] [INFO ] Added : 302 causal constraints over 61 iterations in 13418 ms. Result :sat
Minimization took 1910 ms.
[2022-05-15 20:36:23] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:36:23] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-15 20:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:36:24] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2022-05-15 20:36:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:36:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 20:36:24] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-15 20:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:36:24] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2022-05-15 20:36:24] [INFO ] [Nat]Added 73 Read/Feed constraints in 48 ms returned sat
[2022-05-15 20:36:24] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2022-05-15 20:36:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2022-05-15 20:36:24] [INFO ] Computed and/alt/rep : 378/2192/378 causal constraints (skipped 86 transitions) in 33 ms.
[2022-05-15 20:36:26] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2022-05-15 20:36:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2022-05-15 20:36:26] [INFO ] Added : 121 causal constraints over 25 iterations in 1590 ms. Result :sat
Minimization took 1641 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 14 out of 490 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 490/490 places, 465/465 transitions.
Applied a total of 0 rules in 32 ms. Remains 490 /490 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 490/490 places, 465/465 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 490/490 places, 465/465 transitions.
Applied a total of 0 rules in 30 ms. Remains 490 /490 variables (removed 0) and now considering 465/465 (removed 0) transitions.
// Phase 1: matrix 465 rows 490 cols
[2022-05-15 20:38:08] [INFO ] Computed 100 place invariants in 54 ms
[2022-05-15 20:38:10] [INFO ] Implicit Places using invariants in 1428 ms returned [14, 20, 45, 51, 71, 76, 97, 102, 124, 130, 152, 158, 159, 181, 186, 207, 213, 220, 234, 239, 262, 268, 290, 295, 318, 323, 344, 349, 371, 377, 398, 400, 404, 424, 430, 453, 458, 462, 480, 488]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1436 ms to find 40 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 450/490 places, 465/465 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 450 transition count 447
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 432 transition count 447
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 432 transition count 447
Applied a total of 37 rules in 46 ms. Remains 432 /450 variables (removed 18) and now considering 447/465 (removed 18) transitions.
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:38:10] [INFO ] Invariants computation overflowed in 24 ms
[2022-05-15 20:38:10] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:38:10] [INFO ] Invariants computation overflowed in 24 ms
[2022-05-15 20:38:10] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:38:42] [INFO ] Performed 402/432 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2022-05-15 20:38:45] [INFO ] Implicit Places using invariants and state equation in 34669 ms returned []
Implicit Place search using SMT with State Equation took 34929 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 432/490 places, 447/465 transitions.
Finished structural reductions, in 2 iterations. Remains : 432/490 places, 447/465 transitions.
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:38:45] [INFO ] Invariants computation overflowed in 25 ms
Incomplete random walk after 1000000 steps, including 144271 resets, run finished after 879 ms. (steps per millisecond=1137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91861 resets, run finished after 646 ms. (steps per millisecond=1547 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91439 resets, run finished after 626 ms. (steps per millisecond=1597 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91252 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91505 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91631 resets, run finished after 620 ms. (steps per millisecond=1612 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91263 resets, run finished after 609 ms. (steps per millisecond=1642 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91537 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91205 resets, run finished after 607 ms. (steps per millisecond=1647 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91624 resets, run finished after 624 ms. (steps per millisecond=1602 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91060 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91453 resets, run finished after 609 ms. (steps per millisecond=1642 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91461 resets, run finished after 611 ms. (steps per millisecond=1636 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91485 resets, run finished after 624 ms. (steps per millisecond=1602 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91407 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 14) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:38:54] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-15 20:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:38:55] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2022-05-15 20:38:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:38:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:38:55] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2022-05-15 20:38:55] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:38:56] [INFO ] [Nat]Added 73 Read/Feed constraints in 244 ms returned sat
[2022-05-15 20:38:56] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 24 ms.
[2022-05-15 20:38:57] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2022-05-15 20:38:57] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2022-05-15 20:38:57] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2022-05-15 20:38:58] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2022-05-15 20:38:58] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2022-05-15 20:38:58] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2022-05-15 20:38:58] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2022-05-15 20:38:59] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2022-05-15 20:38:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1619 ms
[2022-05-15 20:38:59] [INFO ] Added : 114 causal constraints over 23 iterations in 2937 ms. Result :sat
Minimization took 678 ms.
[2022-05-15 20:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:39:00] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2022-05-15 20:39:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:39:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:39:00] [INFO ] [Nat]Absence check using state equation in 501 ms returned sat
[2022-05-15 20:39:01] [INFO ] [Nat]Added 73 Read/Feed constraints in 770 ms returned sat
[2022-05-15 20:39:01] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 24 ms.
[2022-05-15 20:39:03] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2022-05-15 20:39:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2022-05-15 20:39:03] [INFO ] Added : 92 causal constraints over 20 iterations in 2401 ms. Result :sat
Minimization took 2487 ms.
[2022-05-15 20:39:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:39:07] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2022-05-15 20:39:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:39:07] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2022-05-15 20:39:08] [INFO ] [Nat]Added 73 Read/Feed constraints in 1008 ms returned sat
[2022-05-15 20:39:08] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 25 ms.
[2022-05-15 20:39:19] [INFO ] Added : 259 causal constraints over 52 iterations in 10940 ms. Result :sat
Minimization took 1361 ms.
[2022-05-15 20:39:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:39:21] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2022-05-15 20:39:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:39:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:39:21] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2022-05-15 20:39:22] [INFO ] [Nat]Added 73 Read/Feed constraints in 107 ms returned sat
[2022-05-15 20:39:22] [INFO ] Deduced a trap composed of 109 places in 175 ms of which 0 ms to minimize.
[2022-05-15 20:39:22] [INFO ] Deduced a trap composed of 121 places in 191 ms of which 0 ms to minimize.
[2022-05-15 20:39:24] [INFO ] Deduced a trap composed of 125 places in 175 ms of which 1 ms to minimize.
[2022-05-15 20:39:24] [INFO ] Deduced a trap composed of 98 places in 200 ms of which 1 ms to minimize.
[2022-05-15 20:39:24] [INFO ] Deduced a trap composed of 114 places in 183 ms of which 0 ms to minimize.
[2022-05-15 20:39:25] [INFO ] Deduced a trap composed of 124 places in 184 ms of which 1 ms to minimize.
[2022-05-15 20:39:25] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 0 ms to minimize.
[2022-05-15 20:39:25] [INFO ] Deduced a trap composed of 121 places in 171 ms of which 1 ms to minimize.
[2022-05-15 20:39:25] [INFO ] Deduced a trap composed of 116 places in 184 ms of which 0 ms to minimize.
[2022-05-15 20:39:26] [INFO ] Deduced a trap composed of 116 places in 174 ms of which 0 ms to minimize.
[2022-05-15 20:39:26] [INFO ] Deduced a trap composed of 111 places in 174 ms of which 0 ms to minimize.
[2022-05-15 20:39:26] [INFO ] Deduced a trap composed of 118 places in 186 ms of which 0 ms to minimize.
[2022-05-15 20:39:26] [INFO ] Deduced a trap composed of 117 places in 180 ms of which 1 ms to minimize.
[2022-05-15 20:39:27] [INFO ] Deduced a trap composed of 125 places in 182 ms of which 1 ms to minimize.
[2022-05-15 20:39:27] [INFO ] Deduced a trap composed of 115 places in 181 ms of which 1 ms to minimize.
[2022-05-15 20:39:27] [INFO ] Deduced a trap composed of 124 places in 186 ms of which 0 ms to minimize.
[2022-05-15 20:39:27] [INFO ] Deduced a trap composed of 125 places in 169 ms of which 2 ms to minimize.
[2022-05-15 20:39:28] [INFO ] Deduced a trap composed of 115 places in 180 ms of which 0 ms to minimize.
[2022-05-15 20:39:28] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 6100 ms
[2022-05-15 20:39:28] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 25 ms.
[2022-05-15 20:39:30] [INFO ] Deduced a trap composed of 123 places in 192 ms of which 1 ms to minimize.
[2022-05-15 20:39:30] [INFO ] Deduced a trap composed of 111 places in 178 ms of which 1 ms to minimize.
[2022-05-15 20:39:30] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 1 ms to minimize.
[2022-05-15 20:39:30] [INFO ] Deduced a trap composed of 116 places in 187 ms of which 1 ms to minimize.
[2022-05-15 20:39:32] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 0 ms to minimize.
[2022-05-15 20:39:32] [INFO ] Deduced a trap composed of 121 places in 187 ms of which 1 ms to minimize.
[2022-05-15 20:39:33] [INFO ] Deduced a trap composed of 111 places in 184 ms of which 1 ms to minimize.
[2022-05-15 20:39:33] [INFO ] Deduced a trap composed of 116 places in 182 ms of which 1 ms to minimize.
[2022-05-15 20:39:33] [INFO ] Deduced a trap composed of 115 places in 183 ms of which 1 ms to minimize.
[2022-05-15 20:39:33] [INFO ] Deduced a trap composed of 114 places in 181 ms of which 0 ms to minimize.
[2022-05-15 20:39:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3666 ms
[2022-05-15 20:39:34] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 1 ms to minimize.
[2022-05-15 20:39:34] [INFO ] Deduced a trap composed of 109 places in 185 ms of which 1 ms to minimize.
[2022-05-15 20:39:34] [INFO ] Deduced a trap composed of 129 places in 171 ms of which 1 ms to minimize.
[2022-05-15 20:39:34] [INFO ] Deduced a trap composed of 109 places in 187 ms of which 1 ms to minimize.
[2022-05-15 20:39:35] [INFO ] Deduced a trap composed of 100 places in 160 ms of which 1 ms to minimize.
[2022-05-15 20:39:36] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 0 ms to minimize.
[2022-05-15 20:39:36] [INFO ] Deduced a trap composed of 130 places in 182 ms of which 1 ms to minimize.
[2022-05-15 20:39:37] [INFO ] Deduced a trap composed of 121 places in 159 ms of which 0 ms to minimize.
[2022-05-15 20:39:37] [INFO ] Deduced a trap composed of 128 places in 178 ms of which 1 ms to minimize.
[2022-05-15 20:39:37] [INFO ] Deduced a trap composed of 105 places in 175 ms of which 0 ms to minimize.
[2022-05-15 20:39:37] [INFO ] Deduced a trap composed of 125 places in 163 ms of which 1 ms to minimize.
[2022-05-15 20:39:37] [INFO ] Deduced a trap composed of 128 places in 189 ms of which 0 ms to minimize.
[2022-05-15 20:39:38] [INFO ] Deduced a trap composed of 132 places in 181 ms of which 3 ms to minimize.
[2022-05-15 20:39:38] [INFO ] Deduced a trap composed of 121 places in 175 ms of which 1 ms to minimize.
[2022-05-15 20:39:38] [INFO ] Deduced a trap composed of 127 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:39:38] [INFO ] Deduced a trap composed of 119 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:39:39] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:39:39] [INFO ] Deduced a trap composed of 103 places in 177 ms of which 1 ms to minimize.
[2022-05-15 20:39:39] [INFO ] Deduced a trap composed of 129 places in 171 ms of which 0 ms to minimize.
[2022-05-15 20:39:40] [INFO ] Deduced a trap composed of 123 places in 169 ms of which 1 ms to minimize.
[2022-05-15 20:39:40] [INFO ] Deduced a trap composed of 120 places in 172 ms of which 0 ms to minimize.
[2022-05-15 20:39:40] [INFO ] Deduced a trap composed of 113 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:39:40] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 0 ms to minimize.
[2022-05-15 20:39:41] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 1 ms to minimize.
[2022-05-15 20:39:41] [INFO ] Deduced a trap composed of 100 places in 171 ms of which 0 ms to minimize.
[2022-05-15 20:39:42] [INFO ] Deduced a trap composed of 98 places in 174 ms of which 0 ms to minimize.
[2022-05-15 20:39:44] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 10200 ms
[2022-05-15 20:39:44] [INFO ] Added : 98 causal constraints over 21 iterations in 16258 ms. Result :sat
Minimization took 1761 ms.
[2022-05-15 20:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:39:46] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2022-05-15 20:39:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:39:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:39:47] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2022-05-15 20:39:47] [INFO ] [Nat]Added 73 Read/Feed constraints in 443 ms returned sat
[2022-05-15 20:39:47] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 24 ms.
[2022-05-15 20:39:51] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 1 ms to minimize.
[2022-05-15 20:39:51] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2022-05-15 20:39:51] [INFO ] Deduced a trap composed of 116 places in 180 ms of which 1 ms to minimize.
[2022-05-15 20:39:51] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2022-05-15 20:39:51] [INFO ] Deduced a trap composed of 119 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:39:52] [INFO ] Deduced a trap composed of 108 places in 169 ms of which 1 ms to minimize.
[2022-05-15 20:39:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1287 ms
[2022-05-15 20:39:52] [INFO ] Added : 98 causal constraints over 22 iterations in 4782 ms. Result :sat
Minimization took 1517 ms.
[2022-05-15 20:39:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:39:54] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2022-05-15 20:39:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:39:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:39:54] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2022-05-15 20:39:55] [INFO ] [Nat]Added 73 Read/Feed constraints in 869 ms returned sat
[2022-05-15 20:39:55] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 24 ms.
[2022-05-15 20:39:59] [INFO ] Deduced a trap composed of 132 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:39:59] [INFO ] Deduced a trap composed of 124 places in 155 ms of which 1 ms to minimize.
[2022-05-15 20:40:00] [INFO ] Deduced a trap composed of 119 places in 161 ms of which 1 ms to minimize.
[2022-05-15 20:40:00] [INFO ] Deduced a trap composed of 134 places in 156 ms of which 0 ms to minimize.
[2022-05-15 20:40:00] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2022-05-15 20:40:00] [INFO ] Deduced a trap composed of 128 places in 157 ms of which 0 ms to minimize.
[2022-05-15 20:40:00] [INFO ] Deduced a trap composed of 122 places in 159 ms of which 1 ms to minimize.
[2022-05-15 20:40:01] [INFO ] Deduced a trap composed of 125 places in 160 ms of which 1 ms to minimize.
[2022-05-15 20:40:01] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 1 ms to minimize.
[2022-05-15 20:40:01] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 0 ms to minimize.
[2022-05-15 20:40:01] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 0 ms to minimize.
[2022-05-15 20:40:02] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:40:02] [INFO ] Deduced a trap composed of 129 places in 150 ms of which 1 ms to minimize.
[2022-05-15 20:40:02] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 0 ms to minimize.
[2022-05-15 20:40:02] [INFO ] Deduced a trap composed of 124 places in 149 ms of which 0 ms to minimize.
[2022-05-15 20:40:02] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 1 ms to minimize.
[2022-05-15 20:40:03] [INFO ] Deduced a trap composed of 109 places in 154 ms of which 0 ms to minimize.
[2022-05-15 20:40:03] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 0 ms to minimize.
[2022-05-15 20:40:03] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3751 ms
[2022-05-15 20:40:03] [INFO ] Added : 261 causal constraints over 53 iterations in 7459 ms. Result :sat
Minimization took 2363 ms.
[2022-05-15 20:40:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:40:06] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2022-05-15 20:40:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:40:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:40:06] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2022-05-15 20:40:07] [INFO ] [Nat]Added 73 Read/Feed constraints in 530 ms returned sat
[2022-05-15 20:40:07] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 26 ms.
[2022-05-15 20:40:16] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:40:16] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2022-05-15 20:40:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 440 ms
[2022-05-15 20:40:16] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2022-05-15 20:40:17] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2022-05-15 20:40:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 457 ms
[2022-05-15 20:40:17] [INFO ] Added : 259 causal constraints over 53 iterations in 9984 ms. Result :sat
Minimization took 2845 ms.
[2022-05-15 20:40:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:40:20] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-05-15 20:40:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:40:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:40:20] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-05-15 20:40:20] [INFO ] [Nat]Added 73 Read/Feed constraints in 149 ms returned sat
[2022-05-15 20:40:20] [INFO ] Deduced a trap composed of 126 places in 185 ms of which 0 ms to minimize.
[2022-05-15 20:40:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2022-05-15 20:40:20] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 30 ms.
[2022-05-15 20:40:22] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 1 ms to minimize.
[2022-05-15 20:40:23] [INFO ] Deduced a trap composed of 118 places in 180 ms of which 0 ms to minimize.
[2022-05-15 20:40:23] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 1 ms to minimize.
[2022-05-15 20:40:23] [INFO ] Deduced a trap composed of 118 places in 181 ms of which 0 ms to minimize.
[2022-05-15 20:40:23] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 1 ms to minimize.
[2022-05-15 20:40:24] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 1 ms to minimize.
[2022-05-15 20:40:24] [INFO ] Deduced a trap composed of 127 places in 180 ms of which 1 ms to minimize.
[2022-05-15 20:40:24] [INFO ] Deduced a trap composed of 120 places in 179 ms of which 0 ms to minimize.
[2022-05-15 20:40:24] [INFO ] Deduced a trap composed of 114 places in 181 ms of which 1 ms to minimize.
[2022-05-15 20:40:24] [INFO ] Deduced a trap composed of 135 places in 181 ms of which 1 ms to minimize.
[2022-05-15 20:40:25] [INFO ] Deduced a trap composed of 122 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:40:25] [INFO ] Deduced a trap composed of 121 places in 171 ms of which 0 ms to minimize.
[2022-05-15 20:40:25] [INFO ] Deduced a trap composed of 123 places in 168 ms of which 1 ms to minimize.
[2022-05-15 20:40:25] [INFO ] Deduced a trap composed of 105 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:40:25] [INFO ] Deduced a trap composed of 115 places in 174 ms of which 1 ms to minimize.
[2022-05-15 20:40:26] [INFO ] Deduced a trap composed of 128 places in 170 ms of which 1 ms to minimize.
[2022-05-15 20:40:26] [INFO ] Deduced a trap composed of 120 places in 169 ms of which 1 ms to minimize.
[2022-05-15 20:40:26] [INFO ] Deduced a trap composed of 121 places in 177 ms of which 1 ms to minimize.
[2022-05-15 20:40:26] [INFO ] Deduced a trap composed of 119 places in 172 ms of which 1 ms to minimize.
[2022-05-15 20:40:27] [INFO ] Deduced a trap composed of 103 places in 172 ms of which 1 ms to minimize.
[2022-05-15 20:40:27] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2022-05-15 20:40:27] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4887 ms
[2022-05-15 20:40:27] [INFO ] Added : 114 causal constraints over 25 iterations in 6923 ms. Result :sat
Minimization took 976 ms.
[2022-05-15 20:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:40:29] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2022-05-15 20:40:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:40:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:40:29] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2022-05-15 20:40:30] [INFO ] [Nat]Added 73 Read/Feed constraints in 1019 ms returned sat
[2022-05-15 20:40:30] [INFO ] Deduced a trap composed of 123 places in 172 ms of which 1 ms to minimize.
[2022-05-15 20:40:31] [INFO ] Deduced a trap composed of 129 places in 172 ms of which 1 ms to minimize.
[2022-05-15 20:40:31] [INFO ] Deduced a trap composed of 122 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:40:31] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 0 ms to minimize.
[2022-05-15 20:40:31] [INFO ] Deduced a trap composed of 124 places in 157 ms of which 0 ms to minimize.
[2022-05-15 20:40:31] [INFO ] Deduced a trap composed of 123 places in 154 ms of which 0 ms to minimize.
[2022-05-15 20:40:32] [INFO ] Deduced a trap composed of 116 places in 171 ms of which 1 ms to minimize.
[2022-05-15 20:40:32] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:40:32] [INFO ] Deduced a trap composed of 130 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:40:32] [INFO ] Deduced a trap composed of 135 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:40:32] [INFO ] Deduced a trap composed of 119 places in 159 ms of which 1 ms to minimize.
[2022-05-15 20:40:33] [INFO ] Deduced a trap composed of 131 places in 177 ms of which 2 ms to minimize.
[2022-05-15 20:40:33] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 0 ms to minimize.
[2022-05-15 20:40:34] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:40:34] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:40:34] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3547 ms
[2022-05-15 20:40:34] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 27 ms.
[2022-05-15 20:40:37] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 0 ms to minimize.
[2022-05-15 20:40:37] [INFO ] Deduced a trap composed of 132 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:40:37] [INFO ] Deduced a trap composed of 133 places in 179 ms of which 0 ms to minimize.
[2022-05-15 20:40:38] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2022-05-15 20:40:38] [INFO ] Deduced a trap composed of 127 places in 172 ms of which 0 ms to minimize.
[2022-05-15 20:40:38] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:40:38] [INFO ] Deduced a trap composed of 124 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:40:39] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2022-05-15 20:40:39] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:40:39] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 0 ms to minimize.
[2022-05-15 20:40:39] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:40:40] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:40:40] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 1 ms to minimize.
[2022-05-15 20:40:40] [INFO ] Deduced a trap composed of 134 places in 159 ms of which 0 ms to minimize.
[2022-05-15 20:40:41] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:40:42] [INFO ] Deduced a trap composed of 128 places in 161 ms of which 0 ms to minimize.
[2022-05-15 20:40:42] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:40:42] [INFO ] Deduced a trap composed of 124 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:40:43] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 1 ms to minimize.
[2022-05-15 20:40:44] [INFO ] Deduced a trap composed of 143 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:40:44] [INFO ] Deduced a trap composed of 142 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:40:44] [INFO ] Deduced a trap composed of 129 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:40:44] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:40:45] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 1 ms to minimize.
[2022-05-15 20:40:45] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:40:45] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:40:45] [INFO ] Deduced a trap composed of 150 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:40:46] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:40:46] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:40:47] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:40:47] [INFO ] Deduced a trap composed of 154 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:40:48] [INFO ] Deduced a trap composed of 148 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:40:48] [INFO ] Deduced a trap composed of 149 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:40:49] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:40:49] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:40:49] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 1 ms to minimize.
[2022-05-15 20:40:50] [INFO ] Deduced a trap composed of 130 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:40:50] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:40:51] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:40:51] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:40:52] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 14926 ms
[2022-05-15 20:40:53] [INFO ] Deduced a trap composed of 132 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:40:53] [INFO ] Deduced a trap composed of 129 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:40:55] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:40:55] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 1 ms to minimize.
[2022-05-15 20:40:56] [INFO ] Deduced a trap composed of 140 places in 171 ms of which 0 ms to minimize.
[2022-05-15 20:40:56] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 1 ms to minimize.
[2022-05-15 20:40:57] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:40:57] [INFO ] Deduced a trap composed of 134 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:40:58] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 1 ms to minimize.
[2022-05-15 20:40:58] [INFO ] Deduced a trap composed of 90 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:40:58] [INFO ] Deduced a trap composed of 98 places in 160 ms of which 1 ms to minimize.
[2022-05-15 20:40:59] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:40:59] [INFO ] Deduced a trap composed of 95 places in 163 ms of which 1 ms to minimize.
[2022-05-15 20:40:59] [INFO ] Deduced a trap composed of 101 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:41:01] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:41:01] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:41:01] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:41:01] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 0 ms to minimize.
[2022-05-15 20:41:02] [INFO ] Deduced a trap composed of 145 places in 161 ms of which 1 ms to minimize.
[2022-05-15 20:41:02] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:41:02] [INFO ] Deduced a trap composed of 128 places in 157 ms of which 1 ms to minimize.
[2022-05-15 20:41:03] [INFO ] Deduced a trap composed of 144 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:41:03] [INFO ] Deduced a trap composed of 145 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:41:03] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 1 ms to minimize.
[2022-05-15 20:41:04] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 1 ms to minimize.
[2022-05-15 20:41:04] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 10996 ms
[2022-05-15 20:41:04] [INFO ] Added : 182 causal constraints over 37 iterations in 30388 ms.(timeout) Result :sat
Minimization took 3001 ms.
[2022-05-15 20:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:41:07] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2022-05-15 20:41:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:41:08] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2022-05-15 20:41:08] [INFO ] [Nat]Added 73 Read/Feed constraints in 372 ms returned sat
[2022-05-15 20:41:08] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 26 ms.
[2022-05-15 20:41:11] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2022-05-15 20:41:11] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 0 ms to minimize.
[2022-05-15 20:41:11] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 0 ms to minimize.
[2022-05-15 20:41:11] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:41:12] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:41:12] [INFO ] Deduced a trap composed of 125 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:41:12] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 1 ms to minimize.
[2022-05-15 20:41:12] [INFO ] Deduced a trap composed of 129 places in 175 ms of which 0 ms to minimize.
[2022-05-15 20:41:13] [INFO ] Deduced a trap composed of 129 places in 175 ms of which 1 ms to minimize.
[2022-05-15 20:41:13] [INFO ] Deduced a trap composed of 129 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:41:13] [INFO ] Deduced a trap composed of 130 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:41:13] [INFO ] Deduced a trap composed of 133 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:41:13] [INFO ] Deduced a trap composed of 132 places in 171 ms of which 0 ms to minimize.
[2022-05-15 20:41:14] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:41:14] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2022-05-15 20:41:14] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:41:14] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:41:15] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 0 ms to minimize.
[2022-05-15 20:41:15] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:41:15] [INFO ] Deduced a trap composed of 111 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:41:15] [INFO ] Deduced a trap composed of 115 places in 171 ms of which 1 ms to minimize.
[2022-05-15 20:41:15] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 0 ms to minimize.
[2022-05-15 20:41:16] [INFO ] Deduced a trap composed of 116 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:41:17] [INFO ] Deduced a trap composed of 132 places in 169 ms of which 1 ms to minimize.
[2022-05-15 20:41:17] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:41:17] [INFO ] Deduced a trap composed of 122 places in 171 ms of which 1 ms to minimize.
[2022-05-15 20:41:18] [INFO ] Deduced a trap composed of 127 places in 180 ms of which 1 ms to minimize.
[2022-05-15 20:41:18] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 0 ms to minimize.
[2022-05-15 20:41:18] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 0 ms to minimize.
[2022-05-15 20:41:18] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 1 ms to minimize.
[2022-05-15 20:41:19] [INFO ] Deduced a trap composed of 130 places in 171 ms of which 1 ms to minimize.
[2022-05-15 20:41:19] [INFO ] Deduced a trap composed of 123 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:41:19] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 1 ms to minimize.
[2022-05-15 20:41:20] [INFO ] Deduced a trap composed of 116 places in 156 ms of which 1 ms to minimize.
[2022-05-15 20:41:21] [INFO ] Deduced a trap composed of 133 places in 157 ms of which 1 ms to minimize.
[2022-05-15 20:41:21] [INFO ] Deduced a trap composed of 121 places in 172 ms of which 1 ms to minimize.
[2022-05-15 20:41:21] [INFO ] Deduced a trap composed of 132 places in 180 ms of which 1 ms to minimize.
[2022-05-15 20:41:22] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2022-05-15 20:41:22] [INFO ] Deduced a trap composed of 121 places in 172 ms of which 1 ms to minimize.
[2022-05-15 20:41:22] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 1 ms to minimize.
[2022-05-15 20:41:23] [INFO ] Deduced a trap composed of 126 places in 171 ms of which 0 ms to minimize.
[2022-05-15 20:41:23] [INFO ] Deduced a trap composed of 110 places in 171 ms of which 1 ms to minimize.
[2022-05-15 20:41:24] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:41:25] [INFO ] Deduced a trap composed of 128 places in 169 ms of which 1 ms to minimize.
[2022-05-15 20:41:25] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:41:25] [INFO ] Deduced a trap composed of 122 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:41:26] [INFO ] Deduced a trap composed of 124 places in 170 ms of which 1 ms to minimize.
[2022-05-15 20:41:26] [INFO ] Deduced a trap composed of 125 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:41:26] [INFO ] Deduced a trap composed of 122 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:41:26] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:41:27] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 16274 ms
[2022-05-15 20:41:27] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:41:27] [INFO ] Deduced a trap composed of 119 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:41:28] [INFO ] Deduced a trap composed of 115 places in 171 ms of which 1 ms to minimize.
[2022-05-15 20:41:29] [INFO ] Deduced a trap composed of 133 places in 153 ms of which 0 ms to minimize.
[2022-05-15 20:41:29] [INFO ] Deduced a trap composed of 113 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:41:29] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:41:29] [INFO ] Deduced a trap composed of 125 places in 172 ms of which 0 ms to minimize.
[2022-05-15 20:41:30] [INFO ] Deduced a trap composed of 130 places in 172 ms of which 0 ms to minimize.
[2022-05-15 20:41:30] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:41:30] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 1 ms to minimize.
[2022-05-15 20:41:31] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:41:31] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:41:32] [INFO ] Deduced a trap composed of 117 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:41:32] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 1 ms to minimize.
[2022-05-15 20:41:32] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 1 ms to minimize.
[2022-05-15 20:41:33] [INFO ] Deduced a trap composed of 143 places in 158 ms of which 0 ms to minimize.
[2022-05-15 20:41:33] [INFO ] Deduced a trap composed of 134 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:41:33] [INFO ] Deduced a trap composed of 121 places in 172 ms of which 0 ms to minimize.
[2022-05-15 20:41:34] [INFO ] Deduced a trap composed of 142 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:41:34] [INFO ] Deduced a trap composed of 141 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:41:34] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:41:35] [INFO ] Deduced a trap composed of 129 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:41:35] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 1 ms to minimize.
[2022-05-15 20:41:35] [INFO ] Deduced a trap composed of 128 places in 170 ms of which 0 ms to minimize.
[2022-05-15 20:41:35] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:41:36] [INFO ] Deduced a trap composed of 112 places in 168 ms of which 1 ms to minimize.
[2022-05-15 20:41:36] [INFO ] Deduced a trap composed of 109 places in 170 ms of which 0 ms to minimize.
[2022-05-15 20:41:37] [INFO ] Deduced a trap composed of 115 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:41:37] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:41:37] [INFO ] Deduced a trap composed of 144 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:41:37] [INFO ] Deduced a trap composed of 130 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:41:38] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 1 ms to minimize.
[2022-05-15 20:41:38] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:41:38] [INFO ] Deduced a trap composed of 131 places in 170 ms of which 1 ms to minimize.
[2022-05-15 20:41:38] [INFO ] Deduced a trap composed of 140 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:41:39] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:41:40] [INFO ] Deduced a trap composed of 107 places in 171 ms of which 0 ms to minimize.
[2022-05-15 20:41:40] [INFO ] Deduced a trap composed of 127 places in 170 ms of which 0 ms to minimize.
[2022-05-15 20:41:40] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:41:41] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:41:41] [INFO ] Deduced a trap composed of 120 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:41:42] [INFO ] Deduced a trap composed of 126 places in 159 ms of which 1 ms to minimize.
[2022-05-15 20:41:42] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:41:42] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 0 ms to minimize.
[2022-05-15 20:41:42] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:41:42] [INFO ] Deduced a trap composed of 134 places in 161 ms of which 0 ms to minimize.
[2022-05-15 20:41:43] [INFO ] Deduced a trap composed of 128 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:41:43] [INFO ] Deduced a trap composed of 132 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:41:43] [INFO ] Deduced a trap composed of 130 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:41:45] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:41:45] [INFO ] Deduced a trap composed of 137 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:41:45] [INFO ] Deduced a trap composed of 132 places in 163 ms of which 1 ms to minimize.
[2022-05-15 20:41:46] [INFO ] Deduced a trap composed of 126 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:41:46] [INFO ] Deduced a trap composed of 128 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:41:46] [INFO ] Deduced a trap composed of 140 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:41:46] [INFO ] Deduced a trap composed of 126 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:41:46] [INFO ] Deduced a trap composed of 130 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:41:47] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:41:47] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 1 ms to minimize.
[2022-05-15 20:41:47] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 0 ms to minimize.
[2022-05-15 20:41:47] [INFO ] Deduced a trap composed of 120 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:41:48] [INFO ] Deduced a trap composed of 111 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:41:48] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:41:48] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:41:48] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:41:49] [INFO ] Deduced a trap composed of 114 places in 160 ms of which 1 ms to minimize.
[2022-05-15 20:41:49] [INFO ] Deduced a trap composed of 120 places in 154 ms of which 1 ms to minimize.
[2022-05-15 20:41:49] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 0 ms to minimize.
[2022-05-15 20:41:49] [INFO ] Deduced a trap composed of 121 places in 153 ms of which 0 ms to minimize.
[2022-05-15 20:41:51] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:41:51] [INFO ] Deduced a trap composed of 122 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:41:52] [INFO ] Deduced a trap composed of 134 places in 161 ms of which 0 ms to minimize.
[2022-05-15 20:41:52] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:41:52] [INFO ] Deduced a trap composed of 129 places in 159 ms of which 0 ms to minimize.
[2022-05-15 20:41:52] [INFO ] Deduced a trap composed of 119 places in 161 ms of which 1 ms to minimize.
[2022-05-15 20:41:53] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:41: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 9
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 20:41:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:41:53] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2022-05-15 20:41:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:41:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:41:53] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2022-05-15 20:41:54] [INFO ] [Nat]Added 73 Read/Feed constraints in 616 ms returned sat
[2022-05-15 20:41:54] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 29 ms.
[2022-05-15 20:42:00] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 0 ms to minimize.
[2022-05-15 20:42:01] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2022-05-15 20:42:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 484 ms
[2022-05-15 20:42:01] [INFO ] Added : 213 causal constraints over 44 iterations in 6786 ms. Result :sat
Minimization took 2351 ms.
[2022-05-15 20:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:42:03] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2022-05-15 20:42:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:42:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:42:04] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2022-05-15 20:42:05] [INFO ] [Nat]Added 73 Read/Feed constraints in 556 ms returned sat
[2022-05-15 20:42:05] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 27 ms.
[2022-05-15 20:42:13] [INFO ] Added : 160 causal constraints over 32 iterations in 8646 ms. Result :unknown
[2022-05-15 20:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:42:14] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2022-05-15 20:42:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:42:14] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2022-05-15 20:42:15] [INFO ] [Nat]Added 73 Read/Feed constraints in 677 ms returned sat
[2022-05-15 20:42:15] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 27 ms.
[2022-05-15 20:42:21] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:42:21] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 0 ms to minimize.
[2022-05-15 20:42:22] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
[2022-05-15 20:42:22] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:42:22] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:42:23] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 1 ms to minimize.
[2022-05-15 20:42:23] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2022-05-15 20:42:23] [INFO ] Deduced a trap composed of 153 places in 154 ms of which 0 ms to minimize.
[2022-05-15 20:42:23] [INFO ] Deduced a trap composed of 148 places in 153 ms of which 0 ms to minimize.
[2022-05-15 20:42:24] [INFO ] Deduced a trap composed of 152 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:42:24] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 0 ms to minimize.
[2022-05-15 20:42:24] [INFO ] Deduced a trap composed of 140 places in 155 ms of which 1 ms to minimize.
[2022-05-15 20:42:24] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 0 ms to minimize.
[2022-05-15 20:42:24] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 0 ms to minimize.
[2022-05-15 20:42:25] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 1 ms to minimize.
[2022-05-15 20:42:25] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 0 ms to minimize.
[2022-05-15 20:42:25] [INFO ] Deduced a trap composed of 133 places in 157 ms of which 0 ms to minimize.
[2022-05-15 20:42:25] [INFO ] Deduced a trap composed of 146 places in 148 ms of which 1 ms to minimize.
[2022-05-15 20:42:25] [INFO ] Deduced a trap composed of 146 places in 155 ms of which 1 ms to minimize.
[2022-05-15 20:42:26] [INFO ] Deduced a trap composed of 129 places in 151 ms of which 0 ms to minimize.
[2022-05-15 20:42:26] [INFO ] Deduced a trap composed of 140 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:42:26] [INFO ] Deduced a trap composed of 142 places in 154 ms of which 1 ms to minimize.
[2022-05-15 20:42:26] [INFO ] Deduced a trap composed of 136 places in 141 ms of which 0 ms to minimize.
[2022-05-15 20:42:26] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 1 ms to minimize.
[2022-05-15 20:42:27] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 0 ms to minimize.
[2022-05-15 20:42:27] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 0 ms to minimize.
[2022-05-15 20:42:27] [INFO ] Deduced a trap composed of 135 places in 141 ms of which 0 ms to minimize.
[2022-05-15 20:42:27] [INFO ] Deduced a trap composed of 128 places in 146 ms of which 0 ms to minimize.
[2022-05-15 20:42:27] [INFO ] Deduced a trap composed of 142 places in 143 ms of which 0 ms to minimize.
[2022-05-15 20:42:28] [INFO ] Deduced a trap composed of 150 places in 146 ms of which 0 ms to minimize.
[2022-05-15 20:42:28] [INFO ] Deduced a trap composed of 146 places in 144 ms of which 1 ms to minimize.
[2022-05-15 20:42:28] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:42:28] [INFO ] Deduced a trap composed of 142 places in 144 ms of which 0 ms to minimize.
[2022-05-15 20:42:28] [INFO ] Deduced a trap composed of 147 places in 144 ms of which 0 ms to minimize.
[2022-05-15 20:42:29] [INFO ] Deduced a trap composed of 145 places in 142 ms of which 0 ms to minimize.
[2022-05-15 20:42:29] [INFO ] Deduced a trap composed of 141 places in 140 ms of which 0 ms to minimize.
[2022-05-15 20:42:29] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 1 ms to minimize.
[2022-05-15 20:42:29] [INFO ] Deduced a trap composed of 133 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:42:29] [INFO ] Deduced a trap composed of 132 places in 144 ms of which 0 ms to minimize.
[2022-05-15 20:42:30] [INFO ] Deduced a trap composed of 136 places in 142 ms of which 0 ms to minimize.
[2022-05-15 20:42:30] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2022-05-15 20:42:30] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 0 ms to minimize.
[2022-05-15 20:42:30] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 0 ms to minimize.
[2022-05-15 20:42:30] [INFO ] Deduced a trap composed of 134 places in 145 ms of which 0 ms to minimize.
[2022-05-15 20:42:31] [INFO ] Deduced a trap composed of 142 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:42:31] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2022-05-15 20:42:31] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 1 ms to minimize.
[2022-05-15 20:42:31] [INFO ] Deduced a trap composed of 135 places in 159 ms of which 1 ms to minimize.
[2022-05-15 20:42:31] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:42:32] [INFO ] Deduced a trap composed of 134 places in 159 ms of which 1 ms to minimize.
[2022-05-15 20:42:32] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 0 ms to minimize.
[2022-05-15 20:42:32] [INFO ] Deduced a trap composed of 151 places in 170 ms of which 1 ms to minimize.
[2022-05-15 20:42:32] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 0 ms to minimize.
[2022-05-15 20:42:33] [INFO ] Deduced a trap composed of 146 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:42:33] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 0 ms to minimize.
[2022-05-15 20:42:33] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 0 ms to minimize.
[2022-05-15 20:42:33] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2022-05-15 20:42:33] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 0 ms to minimize.
[2022-05-15 20:42:33] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:42:34] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2022-05-15 20:42:34] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 0 ms to minimize.
[2022-05-15 20:42:34] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2022-05-15 20:42:34] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2022-05-15 20:42:34] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:42:35] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 0 ms to minimize.
[2022-05-15 20:42:35] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:42:35] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 0 ms to minimize.
[2022-05-15 20:42:35] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:42:35] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 0 ms to minimize.
[2022-05-15 20:42:36] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 0 ms to minimize.
[2022-05-15 20:42:36] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:42:36] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2022-05-15 20:42:36] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:42:39] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:42:39] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2022-05-15 20:42:39] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:42:39] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:42:40] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:42:40] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:42:40] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:42:40] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:42:41] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:42:41] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 0 ms to minimize.
[2022-05-15 20:42:41] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:42:42] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:42:42] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2022-05-15 20:42:42] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 0 ms to minimize.
[2022-05-15 20:42:42] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2022-05-15 20:42:42] [INFO ] Trap strengthening (SAT) tested/added 89/88 trap constraints in 21070 ms
[2022-05-15 20:42:42] [INFO ] Added : 272 causal constraints over 55 iterations in 27566 ms.(timeout) Result :sat
Minimization took 1502 ms.
[2022-05-15 20:42:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:42:44] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2022-05-15 20:42:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:42:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:42:45] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2022-05-15 20:42:45] [INFO ] [Nat]Added 73 Read/Feed constraints in 409 ms returned sat
[2022-05-15 20:42:45] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 29 ms.
[2022-05-15 20:42:48] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 0 ms to minimize.
[2022-05-15 20:42:48] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 0 ms to minimize.
[2022-05-15 20:42:49] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2022-05-15 20:42:49] [INFO ] Deduced a trap composed of 125 places in 177 ms of which 0 ms to minimize.
[2022-05-15 20:42:49] [INFO ] Deduced a trap composed of 123 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:42:49] [INFO ] Deduced a trap composed of 133 places in 177 ms of which 1 ms to minimize.
[2022-05-15 20:42:50] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 1 ms to minimize.
[2022-05-15 20:42:50] [INFO ] Deduced a trap composed of 133 places in 181 ms of which 0 ms to minimize.
[2022-05-15 20:42:50] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 0 ms to minimize.
[2022-05-15 20:42:50] [INFO ] Deduced a trap composed of 124 places in 175 ms of which 0 ms to minimize.
[2022-05-15 20:42:51] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 0 ms to minimize.
[2022-05-15 20:42:51] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 1 ms to minimize.
[2022-05-15 20:42:51] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 1 ms to minimize.
[2022-05-15 20:42:51] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 0 ms to minimize.
[2022-05-15 20:42:51] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 1 ms to minimize.
[2022-05-15 20:42:51] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2022-05-15 20:42:51] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3451 ms
[2022-05-15 20:42:52] [INFO ] Added : 135 causal constraints over 30 iterations in 6463 ms. Result :sat
Minimization took 964 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 14 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Applied a total of 0 rules in 15 ms. Remains 432 /432 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 432/432 places, 447/447 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Applied a total of 0 rules in 14 ms. Remains 432 /432 variables (removed 0) and now considering 447/447 (removed 0) transitions.
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:44:58] [INFO ] Invariants computation overflowed in 36 ms
[2022-05-15 20:44:58] [INFO ] Implicit Places using invariants in 348 ms returned []
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:44:58] [INFO ] Invariants computation overflowed in 24 ms
[2022-05-15 20:44:58] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:45:10] [INFO ] Implicit Places using invariants and state equation in 12192 ms returned []
Implicit Place search using SMT with State Equation took 12543 ms to find 0 implicit places.
[2022-05-15 20:45:10] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:45:10] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-15 20:45:10] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 432/432 places, 447/447 transitions.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-00
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:45:10] [INFO ] Invariants computation overflowed in 23 ms
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 916 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:45:11] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:45:11] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2022-05-15 20:45:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:45:12] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2022-05-15 20:45:12] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:45:12] [INFO ] [Nat]Added 73 Read/Feed constraints in 250 ms returned sat
[2022-05-15 20:45:12] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 27 ms.
[2022-05-15 20:45:13] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:45:14] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 0 ms to minimize.
[2022-05-15 20:45:14] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2022-05-15 20:45:14] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:45:14] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2022-05-15 20:45:14] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2022-05-15 20:45:15] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2022-05-15 20:45:15] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2022-05-15 20:45:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1691 ms
[2022-05-15 20:45:15] [INFO ] Added : 114 causal constraints over 23 iterations in 3036 ms. Result :sat
Minimization took 686 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 446
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 431 transition count 443
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 428 transition count 443
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 421 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 417 transition count 437
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 417 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 415 transition count 435
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 415 transition count 435
Applied a total of 37 rules in 90 ms. Remains 415 /432 variables (removed 17) and now considering 435/447 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/432 places, 435/447 transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:45:17] [INFO ] Invariants computation overflowed in 42 ms
Incomplete random walk after 1000000 steps, including 144317 resets, run finished after 824 ms. (steps per millisecond=1213 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 90982 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:45:18] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:45:19] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2022-05-15 20:45:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:45:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:45:19] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2022-05-15 20:45:19] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-15 20:45:20] [INFO ] [Nat]Added 83 Read/Feed constraints in 545 ms returned sat
[2022-05-15 20:45:20] [INFO ] Computed and/alt/rep : 322/2158/322 causal constraints (skipped 112 transitions) in 35 ms.
[2022-05-15 20:45:21] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:45:22] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2022-05-15 20:45:22] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 0 ms to minimize.
[2022-05-15 20:45:22] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2022-05-15 20:45:22] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2022-05-15 20:45:23] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2022-05-15 20:45:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1293 ms
[2022-05-15 20:45:23] [INFO ] Added : 112 causal constraints over 23 iterations in 2984 ms. Result :sat
Minimization took 1116 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 24 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 10 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:45:26] [INFO ] Invariants computation overflowed in 54 ms
[2022-05-15 20:45:27] [INFO ] Implicit Places using invariants in 427 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:45:27] [INFO ] Invariants computation overflowed in 61 ms
[2022-05-15 20:45:27] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-15 20:45:41] [INFO ] Implicit Places using invariants and state equation in 14266 ms returned []
Implicit Place search using SMT with State Equation took 14694 ms to find 0 implicit places.
[2022-05-15 20:45:41] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:45:41] [INFO ] Invariants computation overflowed in 23 ms
[2022-05-15 20:45:41] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-00 in 30770 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-01
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:45:41] [INFO ] Invariants computation overflowed in 23 ms
Incomplete random walk after 10000 steps, including 1432 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 897 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:45:41] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:45:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:45:42] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2022-05-15 20:45:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:45:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:45:42] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2022-05-15 20:45:42] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:45:43] [INFO ] [Nat]Added 73 Read/Feed constraints in 775 ms returned sat
[2022-05-15 20:45:43] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 24 ms.
[2022-05-15 20:45:45] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2022-05-15 20:45:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2022-05-15 20:45:45] [INFO ] Added : 92 causal constraints over 20 iterations in 2387 ms. Result :sat
Minimization took 1255 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 446
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 431 transition count 443
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 428 transition count 443
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 420 transition count 435
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 417 transition count 436
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 417 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 415 transition count 434
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 415 transition count 434
Applied a total of 37 rules in 54 ms. Remains 415 /432 variables (removed 17) and now considering 434/447 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/432 places, 434/447 transitions.
// Phase 1: matrix 434 rows 415 cols
[2022-05-15 20:45:47] [INFO ] Invariants computation overflowed in 29 ms
Incomplete random walk after 1000000 steps, including 144209 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91467 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 415 cols
[2022-05-15 20:45:48] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:45:48] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2022-05-15 20:45:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:45:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:45:49] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2022-05-15 20:45:49] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-05-15 20:45:49] [INFO ] [Nat]Added 82 Read/Feed constraints in 71 ms returned sat
[2022-05-15 20:45:49] [INFO ] Computed and/alt/rep : 324/2152/324 causal constraints (skipped 109 transitions) in 27 ms.
[2022-05-15 20:45:51] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2022-05-15 20:45:51] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2022-05-15 20:45:51] [INFO ] Deduced a trap composed of 110 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:45:52] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 1 ms to minimize.
[2022-05-15 20:45:52] [INFO ] Deduced a trap composed of 119 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:45:52] [INFO ] Deduced a trap composed of 99 places in 177 ms of which 0 ms to minimize.
[2022-05-15 20:45:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1389 ms
[2022-05-15 20:45:52] [INFO ] Added : 104 causal constraints over 22 iterations in 3100 ms. Result :sat
Minimization took 714 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 434/434 transitions.
Applied a total of 0 rules in 20 ms. Remains 415 /415 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 415 /415 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 415 cols
[2022-05-15 20:45:54] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:45:55] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 434 rows 415 cols
[2022-05-15 20:45:55] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-15 20:45:55] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-05-15 20:46:20] [INFO ] Implicit Places using invariants and state equation in 25597 ms returned []
Implicit Place search using SMT with State Equation took 25882 ms to find 0 implicit places.
[2022-05-15 20:46:20] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 434 rows 415 cols
[2022-05-15 20:46:20] [INFO ] Invariants computation overflowed in 39 ms
[2022-05-15 20:46:20] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-01 in 39234 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-02
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:46:20] [INFO ] Invariants computation overflowed in 24 ms
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 889 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:46:21] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-15 20:46:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:46:21] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2022-05-15 20:46:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:46:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:46:22] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2022-05-15 20:46:22] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:46:23] [INFO ] [Nat]Added 73 Read/Feed constraints in 1024 ms returned sat
[2022-05-15 20:46:23] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 29 ms.
[2022-05-15 20:46:26] [INFO ] Added : 220 causal constraints over 44 iterations in 3373 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 446
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 431 transition count 443
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 428 transition count 443
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 421 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 417 transition count 437
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 417 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 415 transition count 435
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 415 transition count 435
Applied a total of 37 rules in 47 ms. Remains 415 /432 variables (removed 17) and now considering 435/447 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/432 places, 435/447 transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:46:56] [INFO ] Computed 61 place invariants in 59 ms
Incomplete random walk after 1000000 steps, including 144000 resets, run finished after 838 ms. (steps per millisecond=1193 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91227 resets, run finished after 607 ms. (steps per millisecond=1647 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:46:58] [INFO ] Computed 61 place invariants in 79 ms
[2022-05-15 20:46:58] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-15 20:46:58] [INFO ] [Real]Absence check using 3 positive and 58 generalized place invariants in 14 ms returned sat
[2022-05-15 20:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:46:58] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2022-05-15 20:46:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:46:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-15 20:46:58] [INFO ] [Nat]Absence check using 3 positive and 58 generalized place invariants in 14 ms returned sat
[2022-05-15 20:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:46:59] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2022-05-15 20:46:59] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-15 20:47:00] [INFO ] [Nat]Added 84 Read/Feed constraints in 1155 ms returned sat
[2022-05-15 20:47:00] [INFO ] Computed and/alt/rep : 322/2159/322 causal constraints (skipped 112 transitions) in 28 ms.
[2022-05-15 20:47:06] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2022-05-15 20:47:06] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-15 20:47:06] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2022-05-15 20:47:06] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 0 ms to minimize.
[2022-05-15 20:47:06] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2022-05-15 20:47:06] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:47:07] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2022-05-15 20:47:07] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2022-05-15 20:47:08] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2022-05-15 20:47:08] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
[2022-05-15 20:47:08] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 0 ms to minimize.
[2022-05-15 20:47:08] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2022-05-15 20:47:08] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 0 ms to minimize.
[2022-05-15 20:47:08] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 0 ms to minimize.
[2022-05-15 20:47:09] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2022-05-15 20:47:09] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:47:09] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 0 ms to minimize.
[2022-05-15 20:47:09] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2022-05-15 20:47:09] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:47:09] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2022-05-15 20:47:09] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:47:09] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:47:10] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:47:10] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2022-05-15 20:47:10] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 0 ms to minimize.
[2022-05-15 20:47:10] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 0 ms to minimize.
[2022-05-15 20:47:10] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 0 ms to minimize.
[2022-05-15 20:47:10] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:47:11] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:47:11] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 0 ms to minimize.
[2022-05-15 20:47:11] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 0 ms to minimize.
[2022-05-15 20:47:11] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 0 ms to minimize.
[2022-05-15 20:47:11] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 0 ms to minimize.
[2022-05-15 20:47:11] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 0 ms to minimize.
[2022-05-15 20:47:11] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 0 ms to minimize.
[2022-05-15 20:47:11] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
[2022-05-15 20:47:12] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 0 ms to minimize.
[2022-05-15 20:47:12] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 0 ms to minimize.
[2022-05-15 20:47:12] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2022-05-15 20:47:12] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2022-05-15 20:47:12] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 0 ms to minimize.
[2022-05-15 20:47:12] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 6669 ms
[2022-05-15 20:47:13] [INFO ] Added : 248 causal constraints over 50 iterations in 13315 ms. Result :sat
Minimization took 2511 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:47:16] [INFO ] Computed 61 place invariants in 65 ms
[2022-05-15 20:47:16] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:47:16] [INFO ] Computed 61 place invariants in 68 ms
[2022-05-15 20:47:16] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-15 20:47:31] [INFO ] Implicit Places using invariants and state equation in 14379 ms returned []
Implicit Place search using SMT with State Equation took 14764 ms to find 0 implicit places.
[2022-05-15 20:47:31] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:47:31] [INFO ] Computed 61 place invariants in 60 ms
[2022-05-15 20:47:31] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-02 in 70372 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-03
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:47:31] [INFO ] Invariants computation overflowed in 24 ms
Incomplete random walk after 10000 steps, including 1409 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 898 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:47:31] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-15 20:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:47:31] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2022-05-15 20:47:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:47:32] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2022-05-15 20:47:32] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:47:32] [INFO ] [Nat]Added 73 Read/Feed constraints in 110 ms returned sat
[2022-05-15 20:47:32] [INFO ] Deduced a trap composed of 109 places in 178 ms of which 0 ms to minimize.
[2022-05-15 20:47:32] [INFO ] Deduced a trap composed of 121 places in 191 ms of which 0 ms to minimize.
[2022-05-15 20:47:34] [INFO ] Deduced a trap composed of 125 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:47:34] [INFO ] Deduced a trap composed of 98 places in 198 ms of which 1 ms to minimize.
[2022-05-15 20:47:35] [INFO ] Deduced a trap composed of 114 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:47:35] [INFO ] Deduced a trap composed of 124 places in 199 ms of which 1 ms to minimize.
[2022-05-15 20:47:35] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 1 ms to minimize.
[2022-05-15 20:47:35] [INFO ] Deduced a trap composed of 121 places in 174 ms of which 0 ms to minimize.
[2022-05-15 20:47:36] [INFO ] Deduced a trap composed of 116 places in 204 ms of which 0 ms to minimize.
[2022-05-15 20:47:36] [INFO ] Deduced a trap composed of 116 places in 190 ms of which 0 ms to minimize.
[2022-05-15 20:47:36] [INFO ] Deduced a trap composed of 111 places in 202 ms of which 0 ms to minimize.
[2022-05-15 20:47:36] [INFO ] Deduced a trap composed of 118 places in 181 ms of which 0 ms to minimize.
[2022-05-15 20:47:36] [INFO ] Trap strengthening (SAT) tested/added 12/12 trap constraints in 4570 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 446
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 431 transition count 443
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 428 transition count 443
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 420 transition count 435
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 416 transition count 436
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 416 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 414 transition count 434
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 39 place count 414 transition count 434
Applied a total of 39 rules in 49 ms. Remains 414 /432 variables (removed 18) and now considering 434/447 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/432 places, 434/447 transitions.
// Phase 1: matrix 434 rows 414 cols
[2022-05-15 20:47:36] [INFO ] Computed 61 place invariants in 65 ms
Incomplete random walk after 1000000 steps, including 143672 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91262 resets, run finished after 568 ms. (steps per millisecond=1760 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 414 cols
[2022-05-15 20:47:38] [INFO ] Computed 61 place invariants in 73 ms
[2022-05-15 20:47:38] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-15 20:47:38] [INFO ] [Real]Absence check using 19 positive and 42 generalized place invariants in 6 ms returned sat
[2022-05-15 20:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:47:38] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2022-05-15 20:47:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:47:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-05-15 20:47:38] [INFO ] [Nat]Absence check using 19 positive and 42 generalized place invariants in 7 ms returned sat
[2022-05-15 20:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:47:38] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2022-05-15 20:47:38] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-15 20:47:38] [INFO ] [Nat]Added 84 Read/Feed constraints in 57 ms returned sat
[2022-05-15 20:47:38] [INFO ] Computed and/alt/rep : 321/2158/321 causal constraints (skipped 112 transitions) in 23 ms.
[2022-05-15 20:47:41] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:47:41] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 0 ms to minimize.
[2022-05-15 20:47:42] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2022-05-15 20:47:42] [INFO ] Deduced a trap composed of 124 places in 157 ms of which 1 ms to minimize.
[2022-05-15 20:47:42] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:47:42] [INFO ] Deduced a trap composed of 127 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:47:42] [INFO ] Deduced a trap composed of 118 places in 172 ms of which 1 ms to minimize.
[2022-05-15 20:47:43] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:47:43] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 0 ms to minimize.
[2022-05-15 20:47:43] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:47:43] [INFO ] Deduced a trap composed of 114 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:47:43] [INFO ] Deduced a trap composed of 116 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:47:44] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 1 ms to minimize.
[2022-05-15 20:47:44] [INFO ] Deduced a trap composed of 129 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:47:44] [INFO ] Deduced a trap composed of 145 places in 150 ms of which 1 ms to minimize.
[2022-05-15 20:47:44] [INFO ] Deduced a trap composed of 123 places in 157 ms of which 0 ms to minimize.
[2022-05-15 20:47:44] [INFO ] Deduced a trap composed of 116 places in 154 ms of which 1 ms to minimize.
[2022-05-15 20:47:44] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3472 ms
[2022-05-15 20:47:44] [INFO ] Added : 150 causal constraints over 33 iterations in 6002 ms. Result :sat
Minimization took 1173 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 414/414 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 414 /414 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 414/414 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 414 /414 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 414 cols
[2022-05-15 20:47:46] [INFO ] Computed 61 place invariants in 65 ms
[2022-05-15 20:47:46] [INFO ] Implicit Places using invariants in 402 ms returned []
// Phase 1: matrix 434 rows 414 cols
[2022-05-15 20:47:46] [INFO ] Computed 61 place invariants in 70 ms
[2022-05-15 20:47:47] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-15 20:48:04] [INFO ] Implicit Places using invariants and state equation in 17633 ms returned []
Implicit Place search using SMT with State Equation took 18035 ms to find 0 implicit places.
[2022-05-15 20:48:04] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 434 rows 414 cols
[2022-05-15 20:48:04] [INFO ] Computed 61 place invariants in 62 ms
[2022-05-15 20:48:04] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-03 in 33350 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-05
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:48:04] [INFO ] Invariants computation overflowed in 28 ms
Incomplete random walk after 10000 steps, including 1461 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 923 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:48:04] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-15 20:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:05] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2022-05-15 20:48:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:48:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:05] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2022-05-15 20:48:05] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:48:06] [INFO ] [Nat]Added 73 Read/Feed constraints in 442 ms returned sat
[2022-05-15 20:48:06] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 29 ms.
[2022-05-15 20:48:09] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 1 ms to minimize.
[2022-05-15 20:48:09] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:48:10] [INFO ] Deduced a trap composed of 116 places in 171 ms of which 0 ms to minimize.
[2022-05-15 20:48:10] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2022-05-15 20:48:10] [INFO ] Deduced a trap composed of 119 places in 171 ms of which 0 ms to minimize.
[2022-05-15 20:48:10] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 446
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 431 transition count 444
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 429 transition count 444
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 421 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 417 transition count 437
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 417 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 415 transition count 435
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 415 transition count 435
Applied a total of 37 rules in 41 ms. Remains 415 /432 variables (removed 17) and now considering 435/447 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/432 places, 435/447 transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:48:10] [INFO ] Invariants computation overflowed in 29 ms
Incomplete random walk after 1000000 steps, including 144365 resets, run finished after 886 ms. (steps per millisecond=1128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91422 resets, run finished after 616 ms. (steps per millisecond=1623 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:48:12] [INFO ] Invariants computation overflowed in 36 ms
[2022-05-15 20:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:12] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2022-05-15 20:48:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:12] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-05-15 20:48:12] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-15 20:48:12] [INFO ] [Nat]Added 84 Read/Feed constraints in 51 ms returned sat
[2022-05-15 20:48:12] [INFO ] Computed and/alt/rep : 322/2154/322 causal constraints (skipped 112 transitions) in 23 ms.
[2022-05-15 20:48:14] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:48:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-15 20:48:14] [INFO ] Added : 95 causal constraints over 19 iterations in 1529 ms. Result :sat
Minimization took 1291 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:48:15] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:48:16] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:48:16] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:48:16] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-15 20:48:36] [INFO ] Implicit Places using invariants and state equation in 20643 ms returned []
Implicit Place search using SMT with State Equation took 20927 ms to find 0 implicit places.
[2022-05-15 20:48:36] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:48:36] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:48:37] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-05 in 32325 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-06
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:48:37] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:48:37] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:37] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2022-05-15 20:48:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:48:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:38] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2022-05-15 20:48:38] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:48:39] [INFO ] [Nat]Added 73 Read/Feed constraints in 910 ms returned sat
[2022-05-15 20:48:39] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 29 ms.
[2022-05-15 20:48:42] [INFO ] Added : 261 causal constraints over 53 iterations in 3563 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 446
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 431 transition count 443
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 428 transition count 443
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 421 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 417 transition count 437
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 417 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 415 transition count 435
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 415 transition count 435
Applied a total of 37 rules in 46 ms. Remains 415 /432 variables (removed 17) and now considering 435/447 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/432 places, 435/447 transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:49:12] [INFO ] Computed 61 place invariants in 73 ms
Incomplete random walk after 1000000 steps, including 143844 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91499 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:49:14] [INFO ] Computed 61 place invariants in 70 ms
[2022-05-15 20:49:14] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-05-15 20:49:14] [INFO ] [Real]Absence check using 19 positive and 42 generalized place invariants in 7 ms returned sat
[2022-05-15 20:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:49:14] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2022-05-15 20:49:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:49:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-05-15 20:49:14] [INFO ] [Nat]Absence check using 19 positive and 42 generalized place invariants in 7 ms returned sat
[2022-05-15 20:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:49:14] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2022-05-15 20:49:14] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-15 20:49:15] [INFO ] [Nat]Added 83 Read/Feed constraints in 326 ms returned sat
[2022-05-15 20:49:15] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2022-05-15 20:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-15 20:49:15] [INFO ] Computed and/alt/rep : 322/2153/322 causal constraints (skipped 112 transitions) in 32 ms.
[2022-05-15 20:49:19] [INFO ] Added : 235 causal constraints over 47 iterations in 4414 ms. Result :sat
Minimization took 1651 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:49:21] [INFO ] Computed 61 place invariants in 70 ms
[2022-05-15 20:49:21] [INFO ] Implicit Places using invariants in 411 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:49:21] [INFO ] Computed 61 place invariants in 68 ms
[2022-05-15 20:49:22] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-15 20:49:41] [INFO ] Implicit Places using invariants and state equation in 19844 ms returned []
Implicit Place search using SMT with State Equation took 20255 ms to find 0 implicit places.
[2022-05-15 20:49:41] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:49:41] [INFO ] Computed 61 place invariants in 72 ms
[2022-05-15 20:49:41] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-06 in 64991 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-07
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:49:42] [INFO ] Invariants computation overflowed in 32 ms
Incomplete random walk after 10000 steps, including 1410 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:49:42] [INFO ] Invariants computation overflowed in 24 ms
[2022-05-15 20:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:49:42] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2022-05-15 20:49:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:49:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:49:42] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2022-05-15 20:49:42] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:49:43] [INFO ] [Nat]Added 73 Read/Feed constraints in 522 ms returned sat
[2022-05-15 20:49:43] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 26 ms.
[2022-05-15 20:49:47] [INFO ] Added : 200 causal constraints over 40 iterations in 4165 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 446
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 431 transition count 443
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 428 transition count 443
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 421 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 417 transition count 437
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 417 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 416 transition count 436
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 416 transition count 436
Applied a total of 34 rules in 44 ms. Remains 416 /432 variables (removed 16) and now considering 436/447 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/432 places, 436/447 transitions.
// Phase 1: matrix 436 rows 416 cols
[2022-05-15 20:49:47] [INFO ] Computed 61 place invariants in 48 ms
Incomplete random walk after 1000000 steps, including 144514 resets, run finished after 783 ms. (steps per millisecond=1277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91137 resets, run finished after 551 ms. (steps per millisecond=1814 ) properties (out of 1) seen :0
// Phase 1: matrix 436 rows 416 cols
[2022-05-15 20:49:49] [INFO ] Computed 61 place invariants in 63 ms
[2022-05-15 20:49:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-15 20:49:49] [INFO ] [Real]Absence check using 3 positive and 58 generalized place invariants in 14 ms returned sat
[2022-05-15 20:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:49:49] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2022-05-15 20:49:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:49:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-15 20:49:49] [INFO ] [Nat]Absence check using 3 positive and 58 generalized place invariants in 14 ms returned sat
[2022-05-15 20:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:49:49] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2022-05-15 20:49:49] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-15 20:49:50] [INFO ] [Nat]Added 83 Read/Feed constraints in 1025 ms returned sat
[2022-05-15 20:49:51] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2022-05-15 20:49:51] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2022-05-15 20:49:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 274 ms
[2022-05-15 20:49:51] [INFO ] Computed and/alt/rep : 323/2154/323 causal constraints (skipped 112 transitions) in 24 ms.
[2022-05-15 20:49:58] [INFO ] Added : 252 causal constraints over 51 iterations in 7249 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 436/436 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 436/436 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 436/436 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 416 cols
[2022-05-15 20:50:01] [INFO ] Computed 61 place invariants in 49 ms
[2022-05-15 20:50:01] [INFO ] Implicit Places using invariants in 388 ms returned []
// Phase 1: matrix 436 rows 416 cols
[2022-05-15 20:50:01] [INFO ] Computed 61 place invariants in 45 ms
[2022-05-15 20:50:02] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-15 20:50:21] [INFO ] Implicit Places using invariants and state equation in 19282 ms returned []
Implicit Place search using SMT with State Equation took 19675 ms to find 0 implicit places.
[2022-05-15 20:50:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 436 rows 416 cols
[2022-05-15 20:50:21] [INFO ] Computed 61 place invariants in 46 ms
[2022-05-15 20:50:21] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 436/436 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-07 in 39450 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-08
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:50:21] [INFO ] Invariants computation overflowed in 25 ms
Incomplete random walk after 10000 steps, including 1454 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:50:21] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-15 20:50:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:50:21] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2022-05-15 20:50:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:50:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:50:21] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2022-05-15 20:50:21] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:50:22] [INFO ] [Nat]Added 73 Read/Feed constraints in 148 ms returned sat
[2022-05-15 20:50:22] [INFO ] Deduced a trap composed of 126 places in 185 ms of which 0 ms to minimize.
[2022-05-15 20:50:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2022-05-15 20:50:22] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 26 ms.
[2022-05-15 20:50:24] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 0 ms to minimize.
[2022-05-15 20:50:24] [INFO ] Deduced a trap composed of 118 places in 183 ms of which 1 ms to minimize.
[2022-05-15 20:50:24] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 0 ms to minimize.
[2022-05-15 20:50:25] [INFO ] Deduced a trap composed of 118 places in 181 ms of which 0 ms to minimize.
[2022-05-15 20:50:25] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 1 ms to minimize.
[2022-05-15 20:50:25] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
[2022-05-15 20:50:25] [INFO ] Deduced a trap composed of 127 places in 178 ms of which 1 ms to minimize.
[2022-05-15 20:50:25] [INFO ] Deduced a trap composed of 120 places in 176 ms of which 0 ms to minimize.
[2022-05-15 20:50:26] [INFO ] Deduced a trap composed of 114 places in 184 ms of which 0 ms to minimize.
[2022-05-15 20:50:26] [INFO ] Deduced a trap composed of 135 places in 180 ms of which 0 ms to minimize.
[2022-05-15 20:50:26] [INFO ] Deduced a trap composed of 122 places in 179 ms of which 0 ms to minimize.
[2022-05-15 20:50:26] [INFO ] Deduced a trap composed of 121 places in 181 ms of which 1 ms to minimize.
[2022-05-15 20:50:26] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 432 transition count 444
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 429 transition count 444
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 22 place count 421 transition count 436
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 418 transition count 437
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 418 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 416 transition count 435
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 416 transition count 435
Applied a total of 35 rules in 41 ms. Remains 416 /432 variables (removed 16) and now considering 435/447 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/432 places, 435/447 transitions.
// Phase 1: matrix 435 rows 416 cols
[2022-05-15 20:50:26] [INFO ] Invariants computation overflowed in 48 ms
Incomplete random walk after 1000000 steps, including 144122 resets, run finished after 775 ms. (steps per millisecond=1290 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91340 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 416 cols
[2022-05-15 20:50:28] [INFO ] Invariants computation overflowed in 58 ms
[2022-05-15 20:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:50:28] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2022-05-15 20:50:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:50:28] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2022-05-15 20:50:28] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-05-15 20:50:29] [INFO ] [Nat]Added 81 Read/Feed constraints in 502 ms returned sat
[2022-05-15 20:50:29] [INFO ] Deduced a trap composed of 122 places in 177 ms of which 1 ms to minimize.
[2022-05-15 20:50:29] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2022-05-15 20:50:29] [INFO ] Deduced a trap composed of 116 places in 174 ms of which 0 ms to minimize.
[2022-05-15 20:50:30] [INFO ] Deduced a trap composed of 118 places in 181 ms of which 0 ms to minimize.
[2022-05-15 20:50:30] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 1 ms to minimize.
[2022-05-15 20:50:30] [INFO ] Deduced a trap composed of 111 places in 179 ms of which 0 ms to minimize.
[2022-05-15 20:50:30] [INFO ] Deduced a trap composed of 112 places in 173 ms of which 1 ms to minimize.
[2022-05-15 20:50:30] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2022-05-15 20:50:30] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2022-05-15 20:50:31] [INFO ] Deduced a trap composed of 121 places in 177 ms of which 0 ms to minimize.
[2022-05-15 20:50:31] [INFO ] Deduced a trap composed of 125 places in 174 ms of which 0 ms to minimize.
[2022-05-15 20:50:31] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:50:31] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:50:31] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2581 ms
[2022-05-15 20:50:31] [INFO ] Computed and/alt/rep : 325/2158/325 causal constraints (skipped 109 transitions) in 28 ms.
[2022-05-15 20:50:33] [INFO ] Deduced a trap composed of 127 places in 182 ms of which 0 ms to minimize.
[2022-05-15 20:50:33] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2022-05-15 20:50:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 449 ms
[2022-05-15 20:50:33] [INFO ] Added : 103 causal constraints over 21 iterations in 1968 ms. Result :sat
Minimization took 293 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 435/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 435/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 416 cols
[2022-05-15 20:50:34] [INFO ] Invariants computation overflowed in 58 ms
[2022-05-15 20:50:34] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 435 rows 416 cols
[2022-05-15 20:50:34] [INFO ] Invariants computation overflowed in 60 ms
[2022-05-15 20:50:35] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-05-15 20:50:54] [INFO ] Implicit Places using invariants and state equation in 19639 ms returned []
Implicit Place search using SMT with State Equation took 19939 ms to find 0 implicit places.
[2022-05-15 20:50:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 435 rows 416 cols
[2022-05-15 20:50:54] [INFO ] Invariants computation overflowed in 55 ms
[2022-05-15 20:50:54] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-08 in 33308 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-09
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:50:54] [INFO ] Invariants computation overflowed in 24 ms
Incomplete random walk after 10000 steps, including 1444 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:50:54] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:50:55] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2022-05-15 20:50:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:50:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:50:55] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2022-05-15 20:50:55] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:50:56] [INFO ] [Nat]Added 73 Read/Feed constraints in 1019 ms returned sat
[2022-05-15 20:50:56] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:50:57] [INFO ] Deduced a trap composed of 129 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:50:57] [INFO ] Deduced a trap composed of 122 places in 160 ms of which 1 ms to minimize.
[2022-05-15 20:50:57] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 0 ms to minimize.
[2022-05-15 20:50:57] [INFO ] Deduced a trap composed of 124 places in 151 ms of which 0 ms to minimize.
[2022-05-15 20:50:57] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 1 ms to minimize.
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 116 places in 174 ms of which 0 ms to minimize.
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 1 ms to minimize.
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 130 places in 158 ms of which 0 ms to minimize.
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 135 places in 155 ms of which 0 ms to minimize.
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:50:59] [INFO ] Deduced a trap composed of 131 places in 170 ms of which 1 ms to minimize.
[2022-05-15 20:50:59] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
[2022-05-15 20:50:59] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2022-05-15 20:51:00] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2022-05-15 20:51:00] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3443 ms
[2022-05-15 20:51:00] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 26 ms.
[2022-05-15 20:51:00] [INFO ] Added : 5 causal constraints over 1 iterations in 64 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 446
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 431 transition count 443
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 428 transition count 443
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 421 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 417 transition count 437
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 417 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 415 transition count 435
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 415 transition count 435
Applied a total of 36 rules in 39 ms. Remains 415 /432 variables (removed 17) and now considering 435/447 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/432 places, 435/447 transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:51:20] [INFO ] Computed 61 place invariants in 71 ms
Incomplete random walk after 1000000 steps, including 144290 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91434 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:51:22] [INFO ] Computed 61 place invariants in 71 ms
[2022-05-15 20:51:22] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-15 20:51:22] [INFO ] [Real]Absence check using 23 positive and 38 generalized place invariants in 5 ms returned sat
[2022-05-15 20:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:51:22] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2022-05-15 20:51:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:51:22] [INFO ] [Nat]Absence check using 23 positive place invariants in 17 ms returned sat
[2022-05-15 20:51:22] [INFO ] [Nat]Absence check using 23 positive and 38 generalized place invariants in 7 ms returned sat
[2022-05-15 20:51:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:51:22] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2022-05-15 20:51:22] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-15 20:51:23] [INFO ] [Nat]Added 84 Read/Feed constraints in 732 ms returned sat
[2022-05-15 20:51:23] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:51:23] [INFO ] Deduced a trap composed of 114 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:51:23] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:51:24] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:51:24] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:51:24] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:51:24] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2022-05-15 20:51:24] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:51:25] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 0 ms to minimize.
[2022-05-15 20:51:25] [INFO ] Deduced a trap composed of 119 places in 154 ms of which 0 ms to minimize.
[2022-05-15 20:51:25] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:51:26] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 1 ms to minimize.
[2022-05-15 20:51:26] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:51:26] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:51:26] [INFO ] Deduced a trap composed of 109 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:51:27] [INFO ] Deduced a trap composed of 120 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:51:27] [INFO ] Deduced a trap composed of 123 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:51:27] [INFO ] Deduced a trap composed of 127 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:51:27] [INFO ] Deduced a trap composed of 132 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:51:27] [INFO ] Deduced a trap composed of 130 places in 161 ms of which 0 ms to minimize.
[2022-05-15 20:51:28] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:51:28] [INFO ] Deduced a trap composed of 126 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:51:28] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:51:28] [INFO ] Deduced a trap composed of 129 places in 161 ms of which 0 ms to minimize.
[2022-05-15 20:51:28] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:51:29] [INFO ] Deduced a trap composed of 121 places in 169 ms of which 1 ms to minimize.
[2022-05-15 20:51:29] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:51:29] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 0 ms to minimize.
[2022-05-15 20:51:29] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:51:29] [INFO ] Deduced a trap composed of 121 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:51:29] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:51:30] [INFO ] Deduced a trap composed of 124 places in 155 ms of which 1 ms to minimize.
[2022-05-15 20:51:30] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:51:30] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:51:30] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:51:31] [INFO ] Deduced a trap composed of 128 places in 161 ms of which 1 ms to minimize.
[2022-05-15 20:51:31] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 1 ms to minimize.
[2022-05-15 20:51:31] [INFO ] Deduced a trap composed of 139 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:51:31] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:51:32] [INFO ] Deduced a trap composed of 124 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:51:32] [INFO ] Deduced a trap composed of 130 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:51:32] [INFO ] Deduced a trap composed of 134 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:51:32] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 9323 ms
[2022-05-15 20:51:32] [INFO ] Computed and/alt/rep : 322/2149/322 causal constraints (skipped 112 transitions) in 27 ms.
[2022-05-15 20:51:40] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 1 ms to minimize.
[2022-05-15 20:51:40] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2022-05-15 20:51:40] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 1 ms to minimize.
[2022-05-15 20:51:40] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2022-05-15 20:51:40] [INFO ] Deduced a trap composed of 128 places in 143 ms of which 0 ms to minimize.
[2022-05-15 20:51:41] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
[2022-05-15 20:51:41] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:51:41] [INFO ] Deduced a trap composed of 136 places in 145 ms of which 1 ms to minimize.
[2022-05-15 20:51:41] [INFO ] Deduced a trap composed of 125 places in 145 ms of which 0 ms to minimize.
[2022-05-15 20:51:41] [INFO ] Deduced a trap composed of 132 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:51:42] [INFO ] Deduced a trap composed of 136 places in 143 ms of which 0 ms to minimize.
[2022-05-15 20:51:42] [INFO ] Deduced a trap composed of 136 places in 143 ms of which 0 ms to minimize.
[2022-05-15 20:51:42] [INFO ] Deduced a trap composed of 132 places in 150 ms of which 1 ms to minimize.
[2022-05-15 20:51:42] [INFO ] Deduced a trap composed of 126 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:51:42] [INFO ] Deduced a trap composed of 126 places in 145 ms of which 0 ms to minimize.
[2022-05-15 20:51:43] [INFO ] Deduced a trap composed of 152 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:51:43] [INFO ] Deduced a trap composed of 153 places in 141 ms of which 0 ms to minimize.
[2022-05-15 20:51:43] [INFO ] Deduced a trap composed of 145 places in 150 ms of which 1 ms to minimize.
[2022-05-15 20:51:43] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:51:43] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 1 ms to minimize.
[2022-05-15 20:51:44] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 1 ms to minimize.
[2022-05-15 20:51:44] [INFO ] Deduced a trap composed of 128 places in 141 ms of which 0 ms to minimize.
[2022-05-15 20:51:44] [INFO ] Deduced a trap composed of 157 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:51:44] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 1 ms to minimize.
[2022-05-15 20:51:44] [INFO ] Deduced a trap composed of 134 places in 144 ms of which 1 ms to minimize.
[2022-05-15 20:51:44] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4911 ms
[2022-05-15 20:51:44] [INFO ] Added : 203 causal constraints over 42 iterations in 12323 ms. Result :sat
Minimization took 3004 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 13 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:51:48] [INFO ] Computed 61 place invariants in 60 ms
[2022-05-15 20:51:48] [INFO ] Implicit Places using invariants in 396 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:51:48] [INFO ] Computed 61 place invariants in 58 ms
[2022-05-15 20:51:48] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-15 20:52:12] [INFO ] Implicit Places using invariants and state equation in 23620 ms returned []
Implicit Place search using SMT with State Equation took 24035 ms to find 0 implicit places.
[2022-05-15 20:52:12] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:52:12] [INFO ] Computed 61 place invariants in 77 ms
[2022-05-15 20:52:12] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-09 in 77617 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-10
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:52:12] [INFO ] Invariants computation overflowed in 28 ms
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:52:12] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:52:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:52:12] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2022-05-15 20:52:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:52:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:52:13] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2022-05-15 20:52:13] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:52:13] [INFO ] [Nat]Added 73 Read/Feed constraints in 351 ms returned sat
[2022-05-15 20:52:13] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 25 ms.
[2022-05-15 20:52:15] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2022-05-15 20:52:16] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 0 ms to minimize.
[2022-05-15 20:52:16] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 0 ms to minimize.
[2022-05-15 20:52:16] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 0 ms to minimize.
[2022-05-15 20:52:16] [INFO ] Deduced a trap composed of 134 places in 168 ms of which 1 ms to minimize.
[2022-05-15 20:52:17] [INFO ] Deduced a trap composed of 125 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:52:17] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2022-05-15 20:52:17] [INFO ] Deduced a trap composed of 129 places in 172 ms of which 0 ms to minimize.
[2022-05-15 20:52:17] [INFO ] Deduced a trap composed of 129 places in 184 ms of which 1 ms to minimize.
[2022-05-15 20:52:17] [INFO ] Deduced a trap composed of 129 places in 180 ms of which 1 ms to minimize.
[2022-05-15 20:52:17] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 446
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 431 transition count 444
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 429 transition count 444
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 421 transition count 436
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 418 transition count 436
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 416 transition count 434
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 416 transition count 434
Applied a total of 35 rules in 40 ms. Remains 416 /432 variables (removed 16) and now considering 434/447 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/432 places, 434/447 transitions.
// Phase 1: matrix 434 rows 416 cols
[2022-05-15 20:52:18] [INFO ] Invariants computation overflowed in 29 ms
Incomplete random walk after 1000000 steps, including 144361 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91117 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2022-05-15 20:52:19] [INFO ] Invariants computation overflowed in 58 ms
[2022-05-15 20:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:52:19] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2022-05-15 20:52:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:52:20] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2022-05-15 20:52:20] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-15 20:52:20] [INFO ] [Nat]Added 83 Read/Feed constraints in 458 ms returned sat
[2022-05-15 20:52:20] [INFO ] Computed and/alt/rep : 328/2180/328 causal constraints (skipped 105 transitions) in 24 ms.
[2022-05-15 20:52:23] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2022-05-15 20:52:23] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2022-05-15 20:52:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2022-05-15 20:52:23] [INFO ] Added : 153 causal constraints over 31 iterations in 2922 ms. Result :sat
Minimization took 1208 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2022-05-15 20:52:55] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:52:55] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2022-05-15 20:52:55] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-15 20:52:55] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-15 20:53:22] [INFO ] Implicit Places using invariants and state equation in 27122 ms returned []
Implicit Place search using SMT with State Equation took 27415 ms to find 0 implicit places.
[2022-05-15 20:53:22] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2022-05-15 20:53:22] [INFO ] Invariants computation overflowed in 36 ms
[2022-05-15 20:53:22] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-10 in 70275 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-11
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:53:22] [INFO ] Invariants computation overflowed in 25 ms
Incomplete random walk after 10000 steps, including 1450 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:53:22] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:53:23] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2022-05-15 20:53:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:53:23] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2022-05-15 20:53:23] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:53:24] [INFO ] [Nat]Added 73 Read/Feed constraints in 593 ms returned sat
[2022-05-15 20:53:24] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 27 ms.
[2022-05-15 20:53:28] [INFO ] Deduced a trap composed of 2 places in 203 ms of which 0 ms to minimize.
[2022-05-15 20:53: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 446
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 431 transition count 443
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 428 transition count 443
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 421 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 417 transition count 437
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 417 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 416 transition count 436
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 416 transition count 436
Applied a total of 34 rules in 38 ms. Remains 416 /432 variables (removed 16) and now considering 436/447 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/432 places, 436/447 transitions.
// Phase 1: matrix 436 rows 416 cols
[2022-05-15 20:53:28] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 1000000 steps, including 144301 resets, run finished after 770 ms. (steps per millisecond=1298 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91475 resets, run finished after 539 ms. (steps per millisecond=1855 ) properties (out of 1) seen :0
// Phase 1: matrix 436 rows 416 cols
[2022-05-15 20:53:29] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:53:30] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-05-15 20:53:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:53:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:53:30] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2022-05-15 20:53:30] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-15 20:53:30] [INFO ] [Nat]Added 83 Read/Feed constraints in 178 ms returned sat
[2022-05-15 20:53:30] [INFO ] Computed and/alt/rep : 323/2143/323 causal constraints (skipped 112 transitions) in 24 ms.
[2022-05-15 20:53:35] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2022-05-15 20:53:35] [INFO ] Deduced a trap composed of 123 places in 180 ms of which 1 ms to minimize.
[2022-05-15 20:53:35] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:53:35] [INFO ] Deduced a trap composed of 114 places in 159 ms of which 1 ms to minimize.
[2022-05-15 20:53:36] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2022-05-15 20:53:36] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 0 ms to minimize.
[2022-05-15 20:53:36] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:53:36] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:53:37] [INFO ] Deduced a trap composed of 129 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:53:37] [INFO ] Deduced a trap composed of 115 places in 170 ms of which 1 ms to minimize.
[2022-05-15 20:53:37] [INFO ] Deduced a trap composed of 94 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:53:37] [INFO ] Deduced a trap composed of 129 places in 143 ms of which 1 ms to minimize.
[2022-05-15 20:53:37] [INFO ] Deduced a trap composed of 128 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:53:38] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 0 ms to minimize.
[2022-05-15 20:53:38] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:53:38] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 0 ms to minimize.
[2022-05-15 20:53:38] [INFO ] Deduced a trap composed of 144 places in 157 ms of which 0 ms to minimize.
[2022-05-15 20:53:38] [INFO ] Deduced a trap composed of 142 places in 174 ms of which 0 ms to minimize.
[2022-05-15 20:53:39] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 1 ms to minimize.
[2022-05-15 20:53:39] [INFO ] Deduced a trap composed of 116 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:53:39] [INFO ] Deduced a trap composed of 119 places in 176 ms of which 1 ms to minimize.
[2022-05-15 20:53:39] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:53:40] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 0 ms to minimize.
[2022-05-15 20:53:40] [INFO ] Deduced a trap composed of 125 places in 156 ms of which 0 ms to minimize.
[2022-05-15 20:53:40] [INFO ] Deduced a trap composed of 132 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:53:40] [INFO ] Deduced a trap composed of 122 places in 184 ms of which 0 ms to minimize.
[2022-05-15 20:53:40] [INFO ] Deduced a trap composed of 134 places in 174 ms of which 1 ms to minimize.
[2022-05-15 20:53:41] [INFO ] Deduced a trap composed of 127 places in 171 ms of which 1 ms to minimize.
[2022-05-15 20:53:41] [INFO ] Deduced a trap composed of 130 places in 172 ms of which 0 ms to minimize.
[2022-05-15 20:53:41] [INFO ] Deduced a trap composed of 113 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:53:41] [INFO ] Deduced a trap composed of 120 places in 170 ms of which 0 ms to minimize.
[2022-05-15 20:53:41] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:53:42] [INFO ] Deduced a trap composed of 87 places in 174 ms of which 1 ms to minimize.
[2022-05-15 20:53:42] [INFO ] Deduced a trap composed of 97 places in 172 ms of which 1 ms to minimize.
[2022-05-15 20:53:42] [INFO ] Deduced a trap composed of 112 places in 179 ms of which 4 ms to minimize.
[2022-05-15 20:53:42] [INFO ] Deduced a trap composed of 84 places in 156 ms of which 0 ms to minimize.
[2022-05-15 20:53:43] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:53:43] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:53:43] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 8476 ms
[2022-05-15 20:53:43] [INFO ] Added : 208 causal constraints over 42 iterations in 13083 ms. Result :sat
Minimization took 2665 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 436/436 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 436/436 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 436/436 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 416 cols
[2022-05-15 20:54:16] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:54:16] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 436 rows 416 cols
[2022-05-15 20:54:16] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:54:16] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-15 20:54:39] [INFO ] Implicit Places using invariants and state equation in 22380 ms returned []
Implicit Place search using SMT with State Equation took 22690 ms to find 0 implicit places.
[2022-05-15 20:54:39] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 436 rows 416 cols
[2022-05-15 20:54:39] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:54:39] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 436/436 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-11 in 76668 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-12
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:54:39] [INFO ] Invariants computation overflowed in 26 ms
Incomplete random walk after 10000 steps, including 1459 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:54:39] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-15 20:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:54:39] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2022-05-15 20:54:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:54:40] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2022-05-15 20:54:40] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:54:41] [INFO ] [Nat]Added 73 Read/Feed constraints in 550 ms returned sat
[2022-05-15 20:54:41] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 34 ms.
[2022-05-15 20:54:44] [INFO ] Added : 160 causal constraints over 32 iterations in 3763 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 446
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 431 transition count 443
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 428 transition count 443
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 421 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 417 transition count 437
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 417 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 415 transition count 435
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 415 transition count 435
Applied a total of 37 rules in 42 ms. Remains 415 /432 variables (removed 17) and now considering 435/447 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/432 places, 435/447 transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:55:14] [INFO ] Computed 61 place invariants in 62 ms
Incomplete random walk after 1000000 steps, including 144390 resets, run finished after 773 ms. (steps per millisecond=1293 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91594 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:55:16] [INFO ] Computed 61 place invariants in 71 ms
[2022-05-15 20:55:16] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-05-15 20:55:16] [INFO ] [Real]Absence check using 19 positive and 42 generalized place invariants in 6 ms returned sat
[2022-05-15 20:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:55:16] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2022-05-15 20:55:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:55:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2022-05-15 20:55:16] [INFO ] [Nat]Absence check using 19 positive and 42 generalized place invariants in 7 ms returned sat
[2022-05-15 20:55:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:55:16] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2022-05-15 20:55:16] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-15 20:55:17] [INFO ] [Nat]Added 84 Read/Feed constraints in 402 ms returned sat
[2022-05-15 20:55:17] [INFO ] Computed and/alt/rep : 323/2160/323 causal constraints (skipped 111 transitions) in 34 ms.
[2022-05-15 20:55:25] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2022-05-15 20:55:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-15 20:55:25] [INFO ] Added : 265 causal constraints over 54 iterations in 8117 ms. Result :sat
Minimization took 2451 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 15 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 14 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:55:58] [INFO ] Computed 61 place invariants in 63 ms
[2022-05-15 20:55:58] [INFO ] Implicit Places using invariants in 464 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:55:58] [INFO ] Computed 61 place invariants in 62 ms
[2022-05-15 20:55:58] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-15 20:56:25] [INFO ] Implicit Places using invariants and state equation in 26632 ms returned []
Implicit Place search using SMT with State Equation took 27108 ms to find 0 implicit places.
[2022-05-15 20:56:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:56:25] [INFO ] Computed 61 place invariants in 63 ms
[2022-05-15 20:56:25] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-12 in 106128 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-13
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:56:25] [INFO ] Invariants computation overflowed in 25 ms
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:56:25] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-15 20:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:56:25] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2022-05-15 20:56:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:56:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:56:26] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2022-05-15 20:56:26] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:56:26] [INFO ] [Nat]Added 73 Read/Feed constraints in 637 ms returned sat
[2022-05-15 20:56:27] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 24 ms.
[2022-05-15 20:56:31] [INFO ] Deduced a trap composed of 2 places in 199 ms of which 1 ms to minimize.
[2022-05-15 20:56:31] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 446
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 431 transition count 444
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 429 transition count 444
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 421 transition count 436
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 418 transition count 437
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 418 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 416 transition count 435
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 416 transition count 435
Applied a total of 35 rules in 50 ms. Remains 416 /432 variables (removed 16) and now considering 435/447 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/432 places, 435/447 transitions.
// Phase 1: matrix 435 rows 416 cols
[2022-05-15 20:56:31] [INFO ] Invariants computation overflowed in 41 ms
Incomplete random walk after 1000000 steps, including 144166 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91371 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 416 cols
[2022-05-15 20:56:32] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-15 20:56:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:56:32] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2022-05-15 20:56:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:56:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:56:33] [INFO ] [Nat]Absence check using state equation in 827 ms returned sat
[2022-05-15 20:56:33] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-15 20:56:35] [INFO ] [Nat]Added 84 Read/Feed constraints in 1290 ms returned sat
[2022-05-15 20:56:35] [INFO ] Computed and/alt/rep : 324/2158/324 causal constraints (skipped 110 transitions) in 23 ms.
[2022-05-15 20:56:41] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2022-05-15 20:56:41] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2022-05-15 20:56:41] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2022-05-15 20:56:41] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 0 ms to minimize.
[2022-05-15 20:56:41] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:56:41] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 0 ms to minimize.
[2022-05-15 20:56:42] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2022-05-15 20:56:42] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2022-05-15 20:56:42] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2022-05-15 20:56:42] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2022-05-15 20:56:42] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 0 ms to minimize.
[2022-05-15 20:56:42] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:56:42] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1622 ms
[2022-05-15 20:56:42] [INFO ] Added : 268 causal constraints over 54 iterations in 7590 ms. Result :sat
Minimization took 2764 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 435/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 416 cols
[2022-05-15 20:56:45] [INFO ] Invariants computation overflowed in 47 ms
[2022-05-15 20:56:45] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 435 rows 416 cols
[2022-05-15 20:56:45] [INFO ] Invariants computation overflowed in 47 ms
[2022-05-15 20:56:46] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-15 20:56:59] [INFO ] Implicit Places using invariants and state equation in 13855 ms returned []
Implicit Place search using SMT with State Equation took 14162 ms to find 0 implicit places.
[2022-05-15 20:56:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 435 rows 416 cols
[2022-05-15 20:56:59] [INFO ] Invariants computation overflowed in 36 ms
[2022-05-15 20:56:59] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-13 in 34569 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-15
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:57:00] [INFO ] Invariants computation overflowed in 24 ms
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 934 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 432 cols
[2022-05-15 20:57:00] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-15 20:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:57:00] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2022-05-15 20:57:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:57:00] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2022-05-15 20:57:00] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 20:57:01] [INFO ] [Nat]Added 73 Read/Feed constraints in 393 ms returned sat
[2022-05-15 20:57:01] [INFO ] Computed and/alt/rep : 353/2180/353 causal constraints (skipped 93 transitions) in 24 ms.
[2022-05-15 20:57:04] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:57:04] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 0 ms to minimize.
[2022-05-15 20:57:04] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 1 ms to minimize.
[2022-05-15 20:57:04] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 0 ms to minimize.
[2022-05-15 20:57:05] [INFO ] Deduced a trap composed of 123 places in 179 ms of which 0 ms to minimize.
[2022-05-15 20:57:05] [INFO ] Deduced a trap composed of 133 places in 183 ms of which 1 ms to minimize.
[2022-05-15 20:57:05] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 0 ms to minimize.
[2022-05-15 20:57:05] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 446
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 431 transition count 443
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 428 transition count 443
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 421 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 417 transition count 437
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 417 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 415 transition count 435
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 415 transition count 435
Applied a total of 37 rules in 36 ms. Remains 415 /432 variables (removed 17) and now considering 435/447 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/432 places, 435/447 transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:57:05] [INFO ] Invariants computation overflowed in 29 ms
Incomplete random walk after 1000000 steps, including 144098 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91406 resets, run finished after 545 ms. (steps per millisecond=1834 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:57:06] [INFO ] Invariants computation overflowed in 36 ms
[2022-05-15 20:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:57:07] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2022-05-15 20:57:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:57:07] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2022-05-15 20:57:07] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-15 20:57:08] [INFO ] [Nat]Added 83 Read/Feed constraints in 304 ms returned sat
[2022-05-15 20:57:08] [INFO ] Computed and/alt/rep : 322/2158/322 causal constraints (skipped 112 transitions) in 27 ms.
[2022-05-15 20:57:10] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2022-05-15 20:57:10] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2022-05-15 20:57:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2022-05-15 20:57:10] [INFO ] Added : 112 causal constraints over 24 iterations in 2179 ms. Result :sat
Minimization took 545 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 435/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:57:12] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:57:13] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:57:13] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-15 20:57:13] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-15 20:57:39] [INFO ] Implicit Places using invariants and state equation in 26232 ms returned []
Implicit Place search using SMT with State Equation took 26515 ms to find 0 implicit places.
[2022-05-15 20:57:39] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 435 rows 415 cols
[2022-05-15 20:57:39] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:57:39] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-15 in 39592 ms.
[2022-05-15 20:57:39] [INFO ] Flatten gal took : 131 ms
[2022-05-15 20:57:40] [INFO ] Applying decomposition
[2022-05-15 20:57:40] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12787660221638984606.txt' '-o' '/tmp/graph12787660221638984606.bin' '-w' '/tmp/graph12787660221638984606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12787660221638984606.bin' '-l' '-1' '-v' '-w' '/tmp/graph12787660221638984606.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:57:40] [INFO ] Decomposing Gal with order
[2022-05-15 20:57:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:57:40] [INFO ] Removed a total of 215 redundant transitions.
[2022-05-15 20:57:40] [INFO ] Flatten gal took : 169 ms
[2022-05-15 20:57:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 27 ms.
[2022-05-15 20:57:40] [INFO ] Time to serialize gal into /tmp/UpperBounds15896260853577248436.gal : 29 ms
[2022-05-15 20:57:40] [INFO ] Time to serialize properties into /tmp/UpperBounds976223375826981300.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15896260853577248436.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds976223375826981300.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds976223375826981300.prop.
Detected timeout of ITS tools.
[2022-05-15 21:26:24] [INFO ] Flatten gal took : 46 ms
[2022-05-15 21:26:24] [INFO ] Time to serialize gal into /tmp/UpperBounds14515797282771453160.gal : 8 ms
[2022-05-15 21:26:24] [INFO ] Time to serialize properties into /tmp/UpperBounds2444150290518337310.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14515797282771453160.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2444150290518337310.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds2444150290518337310.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-020"
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-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-020, 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 r078-tall-165260110000205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 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 ;