About the Execution of LTSMin+red for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1469.743 | 3600000.00 | 3941660.00 | 8130.90 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r137-smll-167819418600485.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r137-smll-167819418600485
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 340K Mar 5 18:22 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 1678879303565
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 11:21:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 11:21:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 11:21:47] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2023-03-15 11:21:47] [INFO ] Transformed 1064 places.
[2023-03-15 11:21:47] [INFO ] Transformed 998 transitions.
[2023-03-15 11:21:47] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 998 rows 1064 cols
[2023-03-15 11:21:48] [INFO ] Invariants computation overflowed in 250 ms
Incomplete random walk after 10000 steps, including 337 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 296 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 282 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 287 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 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 283 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :0
// Phase 1: matrix 998 rows 1064 cols
[2023-03-15 11:21:48] [INFO ] Invariants computation overflowed in 217 ms
[2023-03-15 11:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:21:53] [INFO ] [Real]Absence check using state equation in 4469 ms returned unknown
[2023-03-15 11:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:21:57] [INFO ] [Real]Absence check using state equation in 3117 ms returned sat
[2023-03-15 11:21:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:21:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:00] [INFO ] [Nat]Absence check using state equation in 2946 ms returned sat
[2023-03-15 11:22:01] [INFO ] Deduced a trap composed of 72 places in 682 ms of which 8 ms to minimize.
[2023-03-15 11:22:01] [INFO ] Deduced a trap composed of 61 places in 722 ms of which 2 ms to minimize.
[2023-03-15 11:22:02] [INFO ] Deduced a trap composed of 53 places in 685 ms of which 2 ms to minimize.
[2023-03-15 11:22:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-15 11:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:06] [INFO ] [Real]Absence check using state equation in 3776 ms returned sat
[2023-03-15 11:22:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:09] [INFO ] [Nat]Absence check using state equation in 2867 ms returned sat
[2023-03-15 11:22:10] [INFO ] Deduced a trap composed of 77 places in 665 ms of which 3 ms to minimize.
[2023-03-15 11:22:11] [INFO ] Deduced a trap composed of 90 places in 839 ms of which 2 ms to minimize.
[2023-03-15 11:22:12] [INFO ] Deduced a trap composed of 305 places in 692 ms of which 2 ms to minimize.
[2023-03-15 11:22:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-15 11:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:13] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2023-03-15 11:22:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:14] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2023-03-15 11:22:15] [INFO ] Deduced a trap composed of 368 places in 740 ms of which 2 ms to minimize.
[2023-03-15 11:22:16] [INFO ] Deduced a trap composed of 59 places in 962 ms of which 3 ms to minimize.
[2023-03-15 11:22:17] [INFO ] Deduced a trap composed of 400 places in 658 ms of which 1 ms to minimize.
[2023-03-15 11:22:18] [INFO ] Deduced a trap composed of 55 places in 807 ms of which 1 ms to minimize.
[2023-03-15 11:22:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-15 11:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:19] [INFO ] [Real]Absence check using state equation in 1134 ms returned sat
[2023-03-15 11:22:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:21] [INFO ] [Nat]Absence check using state equation in 1575 ms returned sat
[2023-03-15 11:22:22] [INFO ] Deduced a trap composed of 445 places in 766 ms of which 1 ms to minimize.
[2023-03-15 11:22:22] [INFO ] Deduced a trap composed of 31 places in 494 ms of which 1 ms to minimize.
[2023-03-15 11:22:23] [INFO ] Deduced a trap composed of 113 places in 470 ms of which 2 ms to minimize.
[2023-03-15 11:22:24] [INFO ] Deduced a trap composed of 89 places in 900 ms of which 5 ms to minimize.
[2023-03-15 11:22:25] [INFO ] Deduced a trap composed of 108 places in 803 ms of which 1 ms to minimize.
[2023-03-15 11:22:25] [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 4
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-15 11:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:28] [INFO ] [Real]Absence check using state equation in 3030 ms returned sat
[2023-03-15 11:22:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:30] [INFO ] [Nat]Absence check using state equation in 1960 ms returned sat
[2023-03-15 11:22:31] [INFO ] Deduced a trap composed of 408 places in 640 ms of which 1 ms to minimize.
[2023-03-15 11:22:32] [INFO ] Deduced a trap composed of 58 places in 827 ms of which 2 ms to minimize.
[2023-03-15 11:22:33] [INFO ] Deduced a trap composed of 418 places in 940 ms of which 1 ms to minimize.
[2023-03-15 11:22:34] [INFO ] Deduced a trap composed of 41 places in 691 ms of which 1 ms to minimize.
[2023-03-15 11:22:34] [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 5
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-15 11:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:35] [INFO ] [Real]Absence check using state equation in 1031 ms returned sat
[2023-03-15 11:22:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:37] [INFO ] [Nat]Absence check using state equation in 1474 ms returned sat
[2023-03-15 11:22:37] [INFO ] Deduced a trap composed of 61 places in 660 ms of which 2 ms to minimize.
[2023-03-15 11:22:38] [INFO ] Deduced a trap composed of 397 places in 964 ms of which 2 ms to minimize.
[2023-03-15 11:22:39] [INFO ] Deduced a trap composed of 415 places in 978 ms of which 2 ms to minimize.
[2023-03-15 11:22:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3031 ms
[2023-03-15 11:22:40] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 123 ms.
[2023-03-15 11:22:40] [INFO ] Added : 5 causal constraints over 1 iterations in 361 ms. Result :unknown
[2023-03-15 11:22:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:41] [INFO ] [Real]Absence check using state equation in 856 ms returned sat
[2023-03-15 11:22:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:42] [INFO ] [Nat]Absence check using state equation in 782 ms returned sat
[2023-03-15 11:22:42] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 69 ms.
[2023-03-15 11:22:46] [INFO ] Added : 50 causal constraints over 10 iterations in 3970 ms. Result :unknown
[2023-03-15 11:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:48] [INFO ] [Real]Absence check using state equation in 1869 ms returned sat
[2023-03-15 11:22:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:51] [INFO ] [Nat]Absence check using state equation in 2128 ms returned sat
[2023-03-15 11:22:51] [INFO ] Deduced a trap composed of 67 places in 412 ms of which 1 ms to minimize.
[2023-03-15 11:22:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 568 ms
[2023-03-15 11:22:51] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 70 ms.
[2023-03-15 11:22:53] [INFO ] Added : 20 causal constraints over 4 iterations in 2139 ms. Result :unknown
[2023-03-15 11:22:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:54] [INFO ] [Real]Absence check using state equation in 818 ms returned sat
[2023-03-15 11:22:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:55] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2023-03-15 11:22:56] [INFO ] Deduced a trap composed of 65 places in 581 ms of which 2 ms to minimize.
[2023-03-15 11:22:57] [INFO ] Deduced a trap composed of 73 places in 854 ms of which 2 ms to minimize.
[2023-03-15 11:22:57] [INFO ] Deduced a trap composed of 84 places in 551 ms of which 1 ms to minimize.
[2023-03-15 11:22:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2208 ms
[2023-03-15 11:22:58] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 77 ms.
[2023-03-15 11:22:59] [INFO ] Added : 20 causal constraints over 4 iterations in 1755 ms. Result :unknown
[2023-03-15 11:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:00] [INFO ] [Real]Absence check using state equation in 962 ms returned sat
[2023-03-15 11:23:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:02] [INFO ] [Nat]Absence check using state equation in 995 ms returned sat
[2023-03-15 11:23:02] [INFO ] Deduced a trap composed of 149 places in 493 ms of which 1 ms to minimize.
[2023-03-15 11:23:03] [INFO ] Deduced a trap composed of 137 places in 582 ms of which 1 ms to minimize.
[2023-03-15 11:23:03] [INFO ] Deduced a trap composed of 163 places in 562 ms of which 1 ms to minimize.
[2023-03-15 11:23:04] [INFO ] Deduced a trap composed of 151 places in 563 ms of which 2 ms to minimize.
[2023-03-15 11:23:05] [INFO ] Deduced a trap composed of 175 places in 589 ms of which 2 ms to minimize.
[2023-03-15 11:23:05] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 3866 ms
[2023-03-15 11:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:07] [INFO ] [Real]Absence check using state equation in 951 ms returned sat
[2023-03-15 11:23:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:08] [INFO ] [Nat]Absence check using state equation in 952 ms returned sat
[2023-03-15 11:23:08] [INFO ] Deduced a trap composed of 113 places in 532 ms of which 2 ms to minimize.
[2023-03-15 11:23:09] [INFO ] Deduced a trap composed of 125 places in 584 ms of which 1 ms to minimize.
[2023-03-15 11:23:10] [INFO ] Deduced a trap composed of 501 places in 827 ms of which 1 ms to minimize.
[2023-03-15 11:23:11] [INFO ] Deduced a trap composed of 477 places in 628 ms of which 4 ms to minimize.
[2023-03-15 11:23:11] [INFO ] Deduced a trap composed of 470 places in 664 ms of which 2 ms to minimize.
[2023-03-15 11:23:12] [INFO ] Deduced a trap composed of 89 places in 887 ms of which 5 ms to minimize.
[2023-03-15 11:23:12] [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 11
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-15 11:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:15] [INFO ] [Real]Absence check using state equation in 2933 ms returned sat
[2023-03-15 11:23:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:23:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:19] [INFO ] [Nat]Absence check using state equation in 2867 ms returned sat
[2023-03-15 11:23:19] [INFO ] Deduced a trap composed of 349 places in 843 ms of which 2 ms to minimize.
[2023-03-15 11:23:20] [INFO ] Deduced a trap composed of 163 places in 522 ms of which 1 ms to minimize.
[2023-03-15 11:23:21] [INFO ] Deduced a trap composed of 277 places in 555 ms of which 1 ms to minimize.
[2023-03-15 11:23:21] [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 12
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-15 11:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:24] [INFO ] [Real]Absence check using state equation in 2955 ms returned sat
[2023-03-15 11:23:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:25] [INFO ] [Nat]Absence check using state equation in 802 ms returned sat
[2023-03-15 11:23:26] [INFO ] Deduced a trap composed of 381 places in 787 ms of which 1 ms to minimize.
[2023-03-15 11:23:27] [INFO ] Deduced a trap composed of 394 places in 649 ms of which 1 ms to minimize.
[2023-03-15 11:23:28] [INFO ] Deduced a trap composed of 395 places in 677 ms of which 1 ms to minimize.
[2023-03-15 11:23:29] [INFO ] Deduced a trap composed of 55 places in 667 ms of which 2 ms to minimize.
[2023-03-15 11:23:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3903 ms
[2023-03-15 11:23:29] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 106 ms.
[2023-03-15 11:23:30] [INFO ] Deduced a trap composed of 8 places in 1064 ms of which 2 ms to minimize.
[2023-03-15 11:23:30] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-15 11:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:31] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2023-03-15 11:23:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:32] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2023-03-15 11:23:33] [INFO ] Deduced a trap composed of 396 places in 820 ms of which 2 ms to minimize.
[2023-03-15 11:23:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1453 ms
[2023-03-15 11:23:33] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 116 ms.
[2023-03-15 11:23:36] [INFO ] Added : 20 causal constraints over 4 iterations in 2695 ms. Result :unknown
[2023-03-15 11:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:38] [INFO ] [Real]Absence check using state equation in 1514 ms returned sat
[2023-03-15 11:23:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:23:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:39] [INFO ] [Nat]Absence check using state equation in 1126 ms returned sat
[2023-03-15 11:23:40] [INFO ] Deduced a trap composed of 65 places in 586 ms of which 1 ms to minimize.
[2023-03-15 11:23:40] [INFO ] Deduced a trap composed of 107 places in 638 ms of which 1 ms to minimize.
[2023-03-15 11:23:41] [INFO ] Deduced a trap composed of 105 places in 627 ms of which 1 ms to minimize.
[2023-03-15 11:23:42] [INFO ] Deduced a trap composed of 84 places in 611 ms of which 2 ms to minimize.
[2023-03-15 11:23:43] [INFO ] Deduced a trap composed of 84 places in 593 ms of which 2 ms to minimize.
[2023-03-15 11:23:43] [INFO ] Deduced a trap composed of 108 places in 522 ms of which 2 ms to minimize.
[2023-03-15 11:23: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: Stream close... while checking expression at index 15
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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, -1, -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, 0, 0]
Support contains 16 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1060 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 228 transitions
Trivial Post-agglo rules discarded 228 transitions
Performed 228 trivial Post agglomeration. Transition count delta: 228
Iterating post reduction 0 with 228 rules applied. Total rules applied 229 place count 1060 transition count 770
Reduce places removed 228 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 231 rules applied. Total rules applied 460 place count 832 transition count 767
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 463 place count 829 transition count 767
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 463 place count 829 transition count 724
Deduced a syphon composed of 43 places in 13 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 549 place count 786 transition count 724
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 11 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 3 with 346 rules applied. Total rules applied 895 place count 613 transition count 551
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 10 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 969 place count 576 transition count 551
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1049 place count 576 transition count 471
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 1129 place count 496 transition count 471
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 4 with 79 rules applied. Total rules applied 1208 place count 496 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1209 place count 495 transition count 470
Applied a total of 1209 rules in 411 ms. Remains 495 /1064 variables (removed 569) and now considering 470/998 (removed 528) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 495/1064 places, 470/998 transitions.
// Phase 1: matrix 470 rows 495 cols
[2023-03-15 11:24:58] [INFO ] Computed 101 place invariants in 91 ms
Incomplete random walk after 1000000 steps, including 128351 resets, run finished after 1648 ms. (steps per millisecond=606 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84431 resets, run finished after 1005 ms. (steps per millisecond=995 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84729 resets, run finished after 1001 ms. (steps per millisecond=999 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84602 resets, run finished after 1007 ms. (steps per millisecond=993 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84509 resets, run finished after 1003 ms. (steps per millisecond=997 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84569 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84639 resets, run finished after 1002 ms. (steps per millisecond=998 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85005 resets, run finished after 997 ms. (steps per millisecond=1003 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84668 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84721 resets, run finished after 996 ms. (steps per millisecond=1004 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84947 resets, run finished after 1016 ms. (steps per millisecond=984 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84727 resets, run finished after 1401 ms. (steps per millisecond=713 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84915 resets, run finished after 996 ms. (steps per millisecond=1004 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84558 resets, run finished after 1012 ms. (steps per millisecond=988 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84622 resets, run finished after 1024 ms. (steps per millisecond=976 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84730 resets, run finished after 1429 ms. (steps per millisecond=699 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84643 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties (out of 16) seen :0
[2023-03-15 11:25:17] [INFO ] Invariant cache hit.
[2023-03-15 11:25:17] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-15 11:25:17] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 57 ms returned sat
[2023-03-15 11:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:17] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2023-03-15 11:25:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:25:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-15 11:25:18] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 51 ms returned sat
[2023-03-15 11:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:18] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2023-03-15 11:25:18] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:25:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:25:24] [INFO ] [Nat]Added 73 Read/Feed constraints in 6054 ms returned unknown
[2023-03-15 11:25:24] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:25:24] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 38 ms returned sat
[2023-03-15 11:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:25] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2023-03-15 11:25:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:25:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-15 11:25:25] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 57 ms returned sat
[2023-03-15 11:25:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:26] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2023-03-15 11:25:26] [INFO ] [Nat]Added 73 Read/Feed constraints in 240 ms returned sat
[2023-03-15 11:25:26] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 54 ms.
[2023-03-15 11:25:27] [INFO ] Added : 74 causal constraints over 15 iterations in 1042 ms. Result :sat
Minimization took 1139 ms.
[2023-03-15 11:25:28] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:25:28] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 36 ms returned sat
[2023-03-15 11:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:29] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2023-03-15 11:25:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:25:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-15 11:25:29] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 40 ms returned sat
[2023-03-15 11:25:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:29] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2023-03-15 11:25:30] [INFO ] [Nat]Added 73 Read/Feed constraints in 452 ms returned sat
[2023-03-15 11:25:30] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 43 ms.
[2023-03-15 11:25:36] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 1 ms to minimize.
[2023-03-15 11:25:37] [INFO ] Deduced a trap composed of 19 places in 380 ms of which 1 ms to minimize.
[2023-03-15 11:25:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 840 ms
[2023-03-15 11:25:37] [INFO ] Added : 158 causal constraints over 33 iterations in 6808 ms. Result :sat
Minimization took 1520 ms.
[2023-03-15 11:25:38] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:25:38] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 11:25:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:39] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2023-03-15 11:25:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:25:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:25:39] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 11:25:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:39] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-15 11:25:39] [INFO ] [Nat]Added 73 Read/Feed constraints in 57 ms returned sat
[2023-03-15 11:25:39] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 1 ms to minimize.
[2023-03-15 11:25:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-15 11:25:39] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 48 ms.
[2023-03-15 11:25:40] [INFO ] Added : 58 causal constraints over 12 iterations in 646 ms. Result :sat
Minimization took 1314 ms.
[2023-03-15 11:25:41] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:25:42] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 11:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:42] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2023-03-15 11:25:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:25:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-15 11:25:42] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 56 ms returned sat
[2023-03-15 11:25:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:43] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2023-03-15 11:25:44] [INFO ] [Nat]Added 73 Read/Feed constraints in 1282 ms returned sat
[2023-03-15 11:25:44] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2023-03-15 11:25:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-15 11:25:44] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 39 ms.
[2023-03-15 11:25:57] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2023-03-15 11:25:57] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 0 ms to minimize.
[2023-03-15 11:25:58] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 0 ms to minimize.
[2023-03-15 11:25:58] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 1 ms to minimize.
[2023-03-15 11:25:59] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 1 ms to minimize.
[2023-03-15 11:25:59] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 1 ms to minimize.
[2023-03-15 11:26:00] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 0 ms to minimize.
[2023-03-15 11:26:00] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2023-03-15 11:26:00] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2023-03-15 11:26:00] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2023-03-15 11:26:01] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 0 ms to minimize.
[2023-03-15 11:26:01] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 3 ms to minimize.
[2023-03-15 11:26:01] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 0 ms to minimize.
[2023-03-15 11:26:01] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
[2023-03-15 11:26:02] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2023-03-15 11:26:02] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2023-03-15 11:26:03] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 0 ms to minimize.
[2023-03-15 11:26:03] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2023-03-15 11:26:03] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 1 ms to minimize.
[2023-03-15 11:26:03] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 0 ms to minimize.
[2023-03-15 11:26:04] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 0 ms to minimize.
[2023-03-15 11:26:04] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 0 ms to minimize.
[2023-03-15 11:26:04] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6980 ms
[2023-03-15 11:26:04] [INFO ] Added : 295 causal constraints over 59 iterations in 19591 ms. Result :sat
Minimization took 3047 ms.
[2023-03-15 11:26:07] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:26:07] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 46 ms returned sat
[2023-03-15 11:26:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:26:08] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-15 11:26:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:26:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:26:08] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 38 ms returned sat
[2023-03-15 11:26:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:26:08] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2023-03-15 11:26:08] [INFO ] [Nat]Added 73 Read/Feed constraints in 102 ms returned sat
[2023-03-15 11:26:08] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 39 ms.
[2023-03-15 11:26:13] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 1 ms to minimize.
[2023-03-15 11:26:13] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 1 ms to minimize.
[2023-03-15 11:26:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 593 ms
[2023-03-15 11:26:13] [INFO ] Added : 145 causal constraints over 30 iterations in 4895 ms. Result :sat
Minimization took 1621 ms.
[2023-03-15 11:26:15] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:26:15] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 36 ms returned sat
[2023-03-15 11:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:26:15] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2023-03-15 11:26:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:26:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:26:15] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 54 ms returned sat
[2023-03-15 11:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:26:16] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2023-03-15 11:26:18] [INFO ] [Nat]Added 73 Read/Feed constraints in 1779 ms returned sat
[2023-03-15 11:26:18] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2023-03-15 11:26:18] [INFO ] Deduced a trap composed of 19 places in 330 ms of which 1 ms to minimize.
[2023-03-15 11:26:19] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 1 ms to minimize.
[2023-03-15 11:26:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1388 ms
[2023-03-15 11:26:19] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 62 ms.
[2023-03-15 11:26:26] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 1 ms to minimize.
[2023-03-15 11:26:26] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 0 ms to minimize.
[2023-03-15 11:26:26] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 1 ms to minimize.
[2023-03-15 11:26:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 694 ms
[2023-03-15 11:26:26] [INFO ] Added : 195 causal constraints over 39 iterations in 7331 ms. Result :sat
Minimization took 1530 ms.
[2023-03-15 11:26:28] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:26:28] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 11:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:26:28] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2023-03-15 11:26:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:26:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:26:28] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 11:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:26:29] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2023-03-15 11:26:29] [INFO ] [Nat]Added 73 Read/Feed constraints in 536 ms returned sat
[2023-03-15 11:26:29] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 40 ms.
[2023-03-15 11:26:36] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2023-03-15 11:26:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-15 11:26:36] [INFO ] Added : 220 causal constraints over 44 iterations in 6436 ms. Result :sat
Minimization took 1449 ms.
[2023-03-15 11:26:37] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:26:37] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 36 ms returned sat
[2023-03-15 11:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:26:38] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2023-03-15 11:26:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:26:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:26:38] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 11:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:26:38] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2023-03-15 11:26:39] [INFO ] [Nat]Added 73 Read/Feed constraints in 891 ms returned sat
[2023-03-15 11:26:39] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2023-03-15 11:26:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-15 11:26:39] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 63 ms.
[2023-03-15 11:26:43] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:26:43] [INFO ] Deduced a trap composed of 15 places in 331 ms of which 1 ms to minimize.
[2023-03-15 11:26:44] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 1 ms to minimize.
[2023-03-15 11:26:44] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:26:44] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 1 ms to minimize.
[2023-03-15 11:26:45] [INFO ] Deduced a trap composed of 30 places in 271 ms of which 1 ms to minimize.
[2023-03-15 11:26:45] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 1 ms to minimize.
[2023-03-15 11:26:46] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 1 ms to minimize.
[2023-03-15 11:26:46] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 1 ms to minimize.
[2023-03-15 11:26:46] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 1 ms to minimize.
[2023-03-15 11:26:46] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 0 ms to minimize.
[2023-03-15 11:26:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3898 ms
[2023-03-15 11:26:47] [INFO ] Added : 152 causal constraints over 32 iterations in 7239 ms. Result :sat
Minimization took 2202 ms.
[2023-03-15 11:26:49] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:26:49] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 39 ms returned sat
[2023-03-15 11:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:26:49] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2023-03-15 11:26:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:26:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:26:49] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 11:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:26:50] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2023-03-15 11:26:50] [INFO ] [Nat]Added 73 Read/Feed constraints in 142 ms returned sat
[2023-03-15 11:26:50] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 38 ms.
[2023-03-15 11:26:51] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 0 ms to minimize.
[2023-03-15 11:26:52] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 1 ms to minimize.
[2023-03-15 11:26:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 572 ms
[2023-03-15 11:26:52] [INFO ] Added : 93 causal constraints over 21 iterations in 1752 ms. Result :sat
Minimization took 957 ms.
[2023-03-15 11:26:53] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 11:26:53] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 11:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:26:53] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2023-03-15 11:26:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:26:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:26:53] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 11:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:26:54] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2023-03-15 11:26:55] [INFO ] [Nat]Added 73 Read/Feed constraints in 1227 ms returned sat
[2023-03-15 11:26:55] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 38 ms.
[2023-03-15 11:27:05] [INFO ] Deduced a trap composed of 8 places in 334 ms of which 2 ms to minimize.
[2023-03-15 11:27:06] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 1 ms to minimize.
[2023-03-15 11:27:06] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 1 ms to minimize.
[2023-03-15 11:27:06] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 1 ms to minimize.
[2023-03-15 11:27:07] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 1 ms to minimize.
[2023-03-15 11:27:07] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 2 ms to minimize.
[2023-03-15 11:27:08] [INFO ] Deduced a trap composed of 37 places in 249 ms of which 1 ms to minimize.
[2023-03-15 11:27:08] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 1 ms to minimize.
[2023-03-15 11:27:08] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 1 ms to minimize.
[2023-03-15 11:27:09] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 1 ms to minimize.
[2023-03-15 11:27:09] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 1 ms to minimize.
[2023-03-15 11:27:09] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 1 ms to minimize.
[2023-03-15 11:27:10] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 1 ms to minimize.
[2023-03-15 11:27:10] [INFO ] Deduced a trap composed of 40 places in 297 ms of which 1 ms to minimize.
[2023-03-15 11:27:11] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 1 ms to minimize.
[2023-03-15 11:27:12] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 0 ms to minimize.
[2023-03-15 11:27:12] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2023-03-15 11:27:12] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 1 ms to minimize.
[2023-03-15 11:27:13] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2023-03-15 11:27:13] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 0 ms to minimize.
[2023-03-15 11:27:13] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2023-03-15 11:27:14] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2023-03-15 11:27:14] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 8743 ms
[2023-03-15 11:27:14] [INFO ] Added : 266 causal constraints over 54 iterations in 19200 ms. Result :sat
Minimization took 3020 ms.
[2023-03-15 11:27:17] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:27:17] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 11:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:27:18] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2023-03-15 11:27:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:27:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-15 11:27:18] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 59 ms returned sat
[2023-03-15 11:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:27:18] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2023-03-15 11:27:20] [INFO ] [Nat]Added 73 Read/Feed constraints in 1927 ms returned sat
[2023-03-15 11:27:20] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 38 ms.
[2023-03-15 11:27:30] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 0 ms to minimize.
[2023-03-15 11:27:30] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:27:31] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 2 ms to minimize.
[2023-03-15 11:27:31] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 1 ms to minimize.
[2023-03-15 11:27:32] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 1 ms to minimize.
[2023-03-15 11:27:32] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 1 ms to minimize.
[2023-03-15 11:27:32] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 1 ms to minimize.
[2023-03-15 11:27:33] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 0 ms to minimize.
[2023-03-15 11:27:33] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 1 ms to minimize.
[2023-03-15 11:27:33] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 1 ms to minimize.
[2023-03-15 11:27:34] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 1 ms to minimize.
[2023-03-15 11:27:34] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 1 ms to minimize.
[2023-03-15 11:27:34] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 1 ms to minimize.
[2023-03-15 11:27:34] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 1 ms to minimize.
[2023-03-15 11:27:35] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 1 ms to minimize.
[2023-03-15 11:27:35] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 1 ms to minimize.
[2023-03-15 11:27:36] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 0 ms to minimize.
[2023-03-15 11:27:36] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 1 ms to minimize.
[2023-03-15 11:27:36] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 1 ms to minimize.
[2023-03-15 11:27:37] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 1 ms to minimize.
[2023-03-15 11:27:37] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 0 ms to minimize.
[2023-03-15 11:27:37] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 0 ms to minimize.
[2023-03-15 11:27:38] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 1 ms to minimize.
[2023-03-15 11:27:38] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 1 ms to minimize.
[2023-03-15 11:27:38] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 1 ms to minimize.
[2023-03-15 11:27:38] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 0 ms to minimize.
[2023-03-15 11:27:39] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 0 ms to minimize.
[2023-03-15 11:27:39] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 1 ms to minimize.
[2023-03-15 11:27:39] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 1 ms to minimize.
[2023-03-15 11:27:39] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 9724 ms
[2023-03-15 11:27:40] [INFO ] Added : 287 causal constraints over 58 iterations in 19550 ms. Result :sat
Minimization took 3004 ms.
[2023-03-15 11:27:43] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:27:43] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 36 ms returned sat
[2023-03-15 11:27:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:27:43] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2023-03-15 11:27:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:27:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:27:43] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 36 ms returned sat
[2023-03-15 11:27:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:27:44] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2023-03-15 11:27:45] [INFO ] [Nat]Added 73 Read/Feed constraints in 1096 ms returned sat
[2023-03-15 11:27:45] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 0 ms to minimize.
[2023-03-15 11:27:45] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 0 ms to minimize.
[2023-03-15 11:27:46] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 1 ms to minimize.
[2023-03-15 11:27:46] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 1 ms to minimize.
[2023-03-15 11:27:46] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 1 ms to minimize.
[2023-03-15 11:27:46] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 1 ms to minimize.
[2023-03-15 11:27:47] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 1 ms to minimize.
[2023-03-15 11:27:47] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 1 ms to minimize.
[2023-03-15 11:27:47] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 1 ms to minimize.
[2023-03-15 11:27:48] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 1 ms to minimize.
[2023-03-15 11:27:48] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 0 ms to minimize.
[2023-03-15 11:27:48] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:27:48] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:27:49] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 1 ms to minimize.
[2023-03-15 11:27:49] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 1 ms to minimize.
[2023-03-15 11:27:49] [INFO ] Deduced a trap composed of 18 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:27:50] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 1 ms to minimize.
[2023-03-15 11:27:50] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 1 ms to minimize.
[2023-03-15 11:27:50] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5210 ms
[2023-03-15 11:27:50] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 62 ms.
[2023-03-15 11:27:58] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 1 ms to minimize.
[2023-03-15 11:27:58] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 1 ms to minimize.
[2023-03-15 11:27:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 797 ms
[2023-03-15 11:27:58] [INFO ] Added : 209 causal constraints over 42 iterations in 8095 ms. Result :sat
Minimization took 2588 ms.
[2023-03-15 11:28:01] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:28:01] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 36 ms returned sat
[2023-03-15 11:28:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:01] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2023-03-15 11:28:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:28:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-15 11:28:02] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 57 ms returned sat
[2023-03-15 11:28:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:02] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2023-03-15 11:28:02] [INFO ] [Nat]Added 73 Read/Feed constraints in 57 ms returned sat
[2023-03-15 11:28:02] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 56 ms.
[2023-03-15 11:28:05] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:28:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 454 ms
[2023-03-15 11:28:05] [INFO ] Added : 100 causal constraints over 20 iterations in 3068 ms. Result :sat
Minimization took 1801 ms.
[2023-03-15 11:28:07] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:28:07] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 11:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:07] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2023-03-15 11:28:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:28:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-15 11:28:07] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 47 ms returned sat
[2023-03-15 11:28:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:08] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2023-03-15 11:28:08] [INFO ] [Nat]Added 73 Read/Feed constraints in 89 ms returned sat
[2023-03-15 11:28:08] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 42 ms.
[2023-03-15 11:28:09] [INFO ] Added : 70 causal constraints over 14 iterations in 1169 ms. Result :sat
Minimization took 458 ms.
[2023-03-15 11:28:10] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-15 11:28:10] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 48 ms returned sat
[2023-03-15 11:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:10] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2023-03-15 11:28:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:28:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-15 11:28:10] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 57 ms returned sat
[2023-03-15 11:28:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:11] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2023-03-15 11:28:12] [INFO ] [Nat]Added 73 Read/Feed constraints in 1149 ms returned sat
[2023-03-15 11:28:12] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 37 ms.
[2023-03-15 11:28:23] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 0 ms to minimize.
[2023-03-15 11:28:23] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 1 ms to minimize.
[2023-03-15 11:28:24] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 1 ms to minimize.
[2023-03-15 11:28:24] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 1 ms to minimize.
[2023-03-15 11:28:24] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 1 ms to minimize.
[2023-03-15 11:28:25] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 1 ms to minimize.
[2023-03-15 11:28:25] [INFO ] Deduced a trap composed of 37 places in 251 ms of which 1 ms to minimize.
[2023-03-15 11:28:25] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 1 ms to minimize.
[2023-03-15 11:28:26] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 0 ms to minimize.
[2023-03-15 11:28:26] [INFO ] Deduced a trap composed of 24 places in 256 ms of which 1 ms to minimize.
[2023-03-15 11:28:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4375 ms
[2023-03-15 11:28:28] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 0 ms to minimize.
[2023-03-15 11:28:29] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2023-03-15 11:28:30] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 1 ms to minimize.
[2023-03-15 11:28:30] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 1 ms to minimize.
[2023-03-15 11:28:30] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 1 ms to minimize.
[2023-03-15 11:28:31] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 1 ms to minimize.
[2023-03-15 11:28:31] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 1 ms to minimize.
[2023-03-15 11:28:31] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 1 ms to minimize.
[2023-03-15 11:28:33] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 0 ms to minimize.
[2023-03-15 11:28:33] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 1 ms to minimize.
[2023-03-15 11:28:33] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 0 ms to minimize.
[2023-03-15 11:28:34] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 1 ms to minimize.
[2023-03-15 11:28:34] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 1 ms to minimize.
[2023-03-15 11:28:34] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 0 ms to minimize.
[2023-03-15 11:28:35] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 1 ms to minimize.
[2023-03-15 11:28:35] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 1 ms to minimize.
[2023-03-15 11:28:35] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 1 ms to minimize.
[2023-03-15 11:28:36] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 0 ms to minimize.
[2023-03-15 11:28:36] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 0 ms to minimize.
[2023-03-15 11:28:36] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 1 ms to minimize.
[2023-03-15 11:28:37] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 0 ms to minimize.
[2023-03-15 11:28:37] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 1 ms to minimize.
[2023-03-15 11:28:37] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 1 ms to minimize.
[2023-03-15 11:28:38] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 1 ms to minimize.
[2023-03-15 11:28:38] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 1 ms to minimize.
[2023-03-15 11:28:38] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2023-03-15 11:28:39] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 0 ms to minimize.
[2023-03-15 11:28:42] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 14195 ms
[2023-03-15 11:28:56] [INFO ] Deduced a trap composed of 2 places in 452 ms of which 2 ms to minimize.
[2023-03-15 11:28:56] [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 15
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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, -1, -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, 0, 0]
Support contains 16 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 470/470 transitions.
Applied a total of 0 rules in 42 ms. Remains 495 /495 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 495/495 places, 470/470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 470/470 transitions.
Applied a total of 0 rules in 28 ms. Remains 495 /495 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-15 11:30:30] [INFO ] Invariant cache hit.
[2023-03-15 11:30:32] [INFO ] Implicit Places using invariants in 1250 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1267 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 494/495 places, 470/470 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 493 transition count 469
Applied a total of 2 rules in 74 ms. Remains 493 /494 variables (removed 1) and now considering 469/470 (removed 1) transitions.
// Phase 1: matrix 469 rows 493 cols
[2023-03-15 11:30:32] [INFO ] Invariants computation overflowed in 117 ms
[2023-03-15 11:30:33] [INFO ] Implicit Places using invariants in 1097 ms returned []
// Phase 1: matrix 469 rows 493 cols
[2023-03-15 11:30:33] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-15 11:30:33] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:30:56] [INFO ] Implicit Places using invariants and state equation in 23520 ms returned [296, 301, 323, 328, 350, 355, 377, 383, 404, 406, 430, 436, 458, 485, 491]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 24625 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 478/495 places, 469/470 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 478 transition count 464
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 473 transition count 464
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 473 transition count 464
Applied a total of 15 rules in 108 ms. Remains 473 /478 variables (removed 5) and now considering 464/469 (removed 5) transitions.
// Phase 1: matrix 464 rows 473 cols
[2023-03-15 11:30:57] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-15 11:30:57] [INFO ] Implicit Places using invariants in 685 ms returned []
// Phase 1: matrix 464 rows 473 cols
[2023-03-15 11:30:57] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:30:58] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:31:25] [INFO ] Implicit Places using invariants and state equation in 27545 ms returned [268, 397, 446, 450]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 28233 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 469/495 places, 464/470 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 469 transition count 461
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 466 transition count 461
Applied a total of 6 rules in 41 ms. Remains 466 /469 variables (removed 3) and now considering 461/464 (removed 3) transitions.
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:31:25] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 11:31:25] [INFO ] Implicit Places using invariants in 646 ms returned []
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:31:25] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:31:26] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:31:53] [INFO ] Implicit Places using invariants and state equation in 28000 ms returned []
Implicit Place search using SMT with State Equation took 28650 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 466/495 places, 461/470 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 83028 ms. Remains : 466/495 places, 461/470 transitions.
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:31:53] [INFO ] Invariants computation overflowed in 46 ms
Incomplete random walk after 1000000 steps, including 128188 resets, run finished after 1664 ms. (steps per millisecond=600 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84629 resets, run finished after 1023 ms. (steps per millisecond=977 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84668 resets, run finished after 1027 ms. (steps per millisecond=973 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84658 resets, run finished after 1022 ms. (steps per millisecond=978 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84662 resets, run finished after 1014 ms. (steps per millisecond=986 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84974 resets, run finished after 1014 ms. (steps per millisecond=986 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84717 resets, run finished after 1019 ms. (steps per millisecond=981 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84782 resets, run finished after 1018 ms. (steps per millisecond=982 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84662 resets, run finished after 1009 ms. (steps per millisecond=991 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84813 resets, run finished after 1017 ms. (steps per millisecond=983 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85175 resets, run finished after 1020 ms. (steps per millisecond=980 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84680 resets, run finished after 1137 ms. (steps per millisecond=879 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84619 resets, run finished after 1013 ms. (steps per millisecond=987 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84759 resets, run finished after 1013 ms. (steps per millisecond=987 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84801 resets, run finished after 1016 ms. (steps per millisecond=984 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84708 resets, run finished after 1014 ms. (steps per millisecond=986 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84580 resets, run finished after 1017 ms. (steps per millisecond=983 ) properties (out of 16) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:32:12] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:32:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:12] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2023-03-15 11:32:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:32:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:13] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2023-03-15 11:32:13] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:32:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:32:19] [INFO ] [Nat]Added 73 Read/Feed constraints in 6026 ms returned unknown
[2023-03-15 11:32:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:19] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2023-03-15 11:32:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:20] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2023-03-15 11:32:21] [INFO ] [Nat]Added 73 Read/Feed constraints in 292 ms returned sat
[2023-03-15 11:32:21] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 36 ms.
[2023-03-15 11:32:22] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 1 ms to minimize.
[2023-03-15 11:32:22] [INFO ] Deduced a trap composed of 8 places in 319 ms of which 1 ms to minimize.
[2023-03-15 11:32:22] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 0 ms to minimize.
[2023-03-15 11:32:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 921 ms
[2023-03-15 11:32:23] [INFO ] Added : 81 causal constraints over 17 iterations in 1701 ms. Result :sat
Minimization took 565 ms.
[2023-03-15 11:32:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:24] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2023-03-15 11:32:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:24] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2023-03-15 11:32:25] [INFO ] [Nat]Added 73 Read/Feed constraints in 491 ms returned sat
[2023-03-15 11:32:25] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 36 ms.
[2023-03-15 11:32:27] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 1 ms to minimize.
[2023-03-15 11:32:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-15 11:32:27] [INFO ] Added : 121 causal constraints over 25 iterations in 1966 ms. Result :sat
Minimization took 1234 ms.
[2023-03-15 11:32:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:28] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2023-03-15 11:32:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:32:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:29] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2023-03-15 11:32:29] [INFO ] [Nat]Added 73 Read/Feed constraints in 89 ms returned sat
[2023-03-15 11:32:29] [INFO ] Deduced a trap composed of 14 places in 305 ms of which 1 ms to minimize.
[2023-03-15 11:32:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2023-03-15 11:32:29] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 54 ms.
[2023-03-15 11:32:30] [INFO ] Deduced a trap composed of 12 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:32:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2023-03-15 11:32:30] [INFO ] Added : 46 causal constraints over 10 iterations in 947 ms. Result :sat
Minimization took 1423 ms.
[2023-03-15 11:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:32] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2023-03-15 11:32:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:32:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:32] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-15 11:32:34] [INFO ] [Nat]Added 73 Read/Feed constraints in 1064 ms returned sat
[2023-03-15 11:32:34] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 37 ms.
[2023-03-15 11:32:46] [INFO ] Added : 301 causal constraints over 61 iterations in 12511 ms. Result :sat
Minimization took 2548 ms.
[2023-03-15 11:32:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:50] [INFO ] [Real]Absence check using state equation in 769 ms returned sat
[2023-03-15 11:32:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:32:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:51] [INFO ] [Nat]Absence check using state equation in 1327 ms returned sat
[2023-03-15 11:32:52] [INFO ] [Nat]Added 73 Read/Feed constraints in 1283 ms returned sat
[2023-03-15 11:32:53] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 1 ms to minimize.
[2023-03-15 11:32:53] [INFO ] Deduced a trap composed of 10 places in 363 ms of which 1 ms to minimize.
[2023-03-15 11:32:53] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2023-03-15 11:32:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1127 ms
[2023-03-15 11:32:53] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 66 ms.
[2023-03-15 11:32:55] [INFO ] Deduced a trap composed of 14 places in 318 ms of which 1 ms to minimize.
[2023-03-15 11:32:55] [INFO ] Deduced a trap composed of 15 places in 299 ms of which 1 ms to minimize.
[2023-03-15 11:32:56] [INFO ] Deduced a trap composed of 15 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:32:56] [INFO ] Deduced a trap composed of 20 places in 318 ms of which 1 ms to minimize.
[2023-03-15 11:32:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1520 ms
[2023-03-15 11:32:56] [INFO ] Added : 84 causal constraints over 17 iterations in 3038 ms. Result :sat
Minimization took 2199 ms.
[2023-03-15 11:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:59] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2023-03-15 11:32:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:59] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2023-03-15 11:33:01] [INFO ] [Nat]Added 73 Read/Feed constraints in 1392 ms returned sat
[2023-03-15 11:33:01] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2023-03-15 11:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2023-03-15 11:33:01] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 58 ms.
[2023-03-15 11:33:13] [INFO ] Added : 196 causal constraints over 40 iterations in 12071 ms. Result :sat
Minimization took 1506 ms.
[2023-03-15 11:33:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:33:15] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2023-03-15 11:33:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:33:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:33:15] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-03-15 11:33:16] [INFO ] [Nat]Added 73 Read/Feed constraints in 848 ms returned sat
[2023-03-15 11:33:16] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 37 ms.
[2023-03-15 11:33:23] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 1 ms to minimize.
[2023-03-15 11:33:23] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 0 ms to minimize.
[2023-03-15 11:33:23] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 1 ms to minimize.
[2023-03-15 11:33:24] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 0 ms to minimize.
[2023-03-15 11:33:24] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 1 ms to minimize.
[2023-03-15 11:33:24] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 1 ms to minimize.
[2023-03-15 11:33:25] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 1 ms to minimize.
[2023-03-15 11:33:25] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 1 ms to minimize.
[2023-03-15 11:33:25] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 0 ms to minimize.
[2023-03-15 11:33:26] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2023-03-15 11:33:26] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 1 ms to minimize.
[2023-03-15 11:33:26] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 1 ms to minimize.
[2023-03-15 11:33:27] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 0 ms to minimize.
[2023-03-15 11:33:27] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 0 ms to minimize.
[2023-03-15 11:33:27] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 0 ms to minimize.
[2023-03-15 11:33:27] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 0 ms to minimize.
[2023-03-15 11:33:28] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 1 ms to minimize.
[2023-03-15 11:33:28] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 1 ms to minimize.
[2023-03-15 11:33:28] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 1 ms to minimize.
[2023-03-15 11:33:29] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 1 ms to minimize.
[2023-03-15 11:33:29] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 1 ms to minimize.
[2023-03-15 11:33:29] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 1 ms to minimize.
[2023-03-15 11:33:29] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 4 ms to minimize.
[2023-03-15 11:33:30] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6922 ms
[2023-03-15 11:33:30] [INFO ] Added : 195 causal constraints over 40 iterations in 13560 ms. Result :sat
Minimization took 1514 ms.
[2023-03-15 11:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:33:32] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2023-03-15 11:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:33:32] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2023-03-15 11:33:33] [INFO ] [Nat]Added 73 Read/Feed constraints in 355 ms returned sat
[2023-03-15 11:33:33] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 38 ms.
[2023-03-15 11:33:39] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 2 ms to minimize.
[2023-03-15 11:33:39] [INFO ] Deduced a trap composed of 28 places in 322 ms of which 1 ms to minimize.
[2023-03-15 11:33:40] [INFO ] Deduced a trap composed of 15 places in 303 ms of which 1 ms to minimize.
[2023-03-15 11:33:40] [INFO ] Deduced a trap composed of 15 places in 307 ms of which 1 ms to minimize.
[2023-03-15 11:33:40] [INFO ] Deduced a trap composed of 10 places in 316 ms of which 1 ms to minimize.
[2023-03-15 11:33:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1979 ms
[2023-03-15 11:33:41] [INFO ] Added : 174 causal constraints over 35 iterations in 7858 ms. Result :sat
Minimization took 1295 ms.
[2023-03-15 11:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:33:43] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2023-03-15 11:33:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:33:43] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2023-03-15 11:33:44] [INFO ] [Nat]Added 73 Read/Feed constraints in 890 ms returned sat
[2023-03-15 11:33:44] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 37 ms.
[2023-03-15 11:33:46] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2023-03-15 11:33:46] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 5 ms to minimize.
[2023-03-15 11:33:47] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 3 ms to minimize.
[2023-03-15 11:33:47] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 0 ms to minimize.
[2023-03-15 11:33:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1021 ms
[2023-03-15 11:33:47] [INFO ] Added : 87 causal constraints over 19 iterations in 2603 ms. Result :sat
Minimization took 912 ms.
[2023-03-15 11:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:33:49] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2023-03-15 11:33:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:33:49] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2023-03-15 11:33:50] [INFO ] [Nat]Added 73 Read/Feed constraints in 576 ms returned sat
[2023-03-15 11:33:50] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 41 ms.
[2023-03-15 11:33:56] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2023-03-15 11:33:56] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 1 ms to minimize.
[2023-03-15 11:33:56] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 1 ms to minimize.
[2023-03-15 11:33:57] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 1 ms to minimize.
[2023-03-15 11:33:58] [INFO ] Deduced a trap composed of 15 places in 295 ms of which 1 ms to minimize.
[2023-03-15 11:33:58] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 1 ms to minimize.
[2023-03-15 11:33:58] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 1 ms to minimize.
[2023-03-15 11:33:58] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 1 ms to minimize.
[2023-03-15 11:33:59] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 0 ms to minimize.
[2023-03-15 11:33:59] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 1 ms to minimize.
[2023-03-15 11:33:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3526 ms
[2023-03-15 11:33:59] [INFO ] Added : 204 causal constraints over 43 iterations in 9371 ms. Result :sat
Minimization took 2159 ms.
[2023-03-15 11:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:02] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2023-03-15 11:34:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:34:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:03] [INFO ] [Nat]Absence check using state equation in 707 ms returned sat
[2023-03-15 11:34:05] [INFO ] [Nat]Added 73 Read/Feed constraints in 2152 ms returned sat
[2023-03-15 11:34:05] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-15 11:34:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-15 11:34:05] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 57 ms.
[2023-03-15 11:34:16] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 0 ms to minimize.
[2023-03-15 11:34:17] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 1 ms to minimize.
[2023-03-15 11:34:17] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2023-03-15 11:34:17] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2023-03-15 11:34:17] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2023-03-15 11:34:17] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 0 ms to minimize.
[2023-03-15 11:34:18] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 0 ms to minimize.
[2023-03-15 11:34:18] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 1 ms to minimize.
[2023-03-15 11:34:18] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 1 ms to minimize.
[2023-03-15 11:34:19] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 1 ms to minimize.
[2023-03-15 11:34:19] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 1 ms to minimize.
[2023-03-15 11:34:20] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 1 ms to minimize.
[2023-03-15 11:34:20] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 1 ms to minimize.
[2023-03-15 11:34:20] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 0 ms to minimize.
[2023-03-15 11:34:21] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 1 ms to minimize.
[2023-03-15 11:34:21] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 1 ms to minimize.
[2023-03-15 11:34:22] [INFO ] Deduced a trap composed of 79 places in 274 ms of which 1 ms to minimize.
[2023-03-15 11:34:22] [INFO ] Deduced a trap composed of 46 places in 279 ms of which 0 ms to minimize.
[2023-03-15 11:34:22] [INFO ] Deduced a trap composed of 57 places in 283 ms of which 1 ms to minimize.
[2023-03-15 11:34:23] [INFO ] Deduced a trap composed of 58 places in 274 ms of which 1 ms to minimize.
[2023-03-15 11:34:23] [INFO ] Deduced a trap composed of 39 places in 301 ms of which 1 ms to minimize.
[2023-03-15 11:34:24] [INFO ] Deduced a trap composed of 72 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:34:24] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 1 ms to minimize.
[2023-03-15 11:34:24] [INFO ] Deduced a trap composed of 47 places in 255 ms of which 1 ms to minimize.
[2023-03-15 11:34:25] [INFO ] Deduced a trap composed of 53 places in 276 ms of which 0 ms to minimize.
[2023-03-15 11:34:25] [INFO ] Deduced a trap composed of 73 places in 239 ms of which 1 ms to minimize.
[2023-03-15 11:34:26] [INFO ] Deduced a trap composed of 59 places in 256 ms of which 1 ms to minimize.
[2023-03-15 11:34:26] [INFO ] Deduced a trap composed of 55 places in 248 ms of which 1 ms to minimize.
[2023-03-15 11:34:27] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 1 ms to minimize.
[2023-03-15 11:34:27] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 10720 ms
[2023-03-15 11:34:27] [INFO ] Added : 262 causal constraints over 54 iterations in 21626 ms.(timeout) Result :sat
Minimization took 3001 ms.
[2023-03-15 11:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:31] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2023-03-15 11:34:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:31] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2023-03-15 11:34:32] [INFO ] [Nat]Added 73 Read/Feed constraints in 697 ms returned sat
[2023-03-15 11:34:32] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 1 ms to minimize.
[2023-03-15 11:34:33] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 0 ms to minimize.
[2023-03-15 11:34:33] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 1 ms to minimize.
[2023-03-15 11:34:33] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 1 ms to minimize.
[2023-03-15 11:34:33] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 1 ms to minimize.
[2023-03-15 11:34:33] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 1 ms to minimize.
[2023-03-15 11:34:34] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 1 ms to minimize.
[2023-03-15 11:34:34] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 0 ms to minimize.
[2023-03-15 11:34:34] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 0 ms to minimize.
[2023-03-15 11:34:34] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 1 ms to minimize.
[2023-03-15 11:34:34] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 0 ms to minimize.
[2023-03-15 11:34:35] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 1 ms to minimize.
[2023-03-15 11:34:35] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 1 ms to minimize.
[2023-03-15 11:34:35] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2857 ms
[2023-03-15 11:34:35] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 60 ms.
[2023-03-15 11:34:40] [INFO ] Added : 180 causal constraints over 36 iterations in 5364 ms. Result :sat
Minimization took 2065 ms.
[2023-03-15 11:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:43] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2023-03-15 11:34:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:43] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2023-03-15 11:34:43] [INFO ] [Nat]Added 73 Read/Feed constraints in 250 ms returned sat
[2023-03-15 11:34:43] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 44 ms.
[2023-03-15 11:34:46] [INFO ] Added : 73 causal constraints over 15 iterations in 2733 ms. Result :sat
Minimization took 669 ms.
[2023-03-15 11:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:47] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2023-03-15 11:34:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:34:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:48] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2023-03-15 11:34:49] [INFO ] [Nat]Added 73 Read/Feed constraints in 1438 ms returned sat
[2023-03-15 11:34:49] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 40 ms.
[2023-03-15 11:34:50] [INFO ] Deduced a trap composed of 18 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:34:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2023-03-15 11:34:50] [INFO ] Added : 58 causal constraints over 12 iterations in 1016 ms. Result :sat
Minimization took 649 ms.
[2023-03-15 11:34:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:51] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2023-03-15 11:34:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:52] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2023-03-15 11:34:55] [INFO ] [Nat]Added 73 Read/Feed constraints in 2284 ms returned sat
[2023-03-15 11:34:55] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 38 ms.
[2023-03-15 11:35:07] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 1 ms to minimize.
[2023-03-15 11:35:07] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 0 ms to minimize.
[2023-03-15 11:35:07] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 0 ms to minimize.
[2023-03-15 11:35:08] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 0 ms to minimize.
[2023-03-15 11:35:08] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2023-03-15 11:35:08] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 1 ms to minimize.
[2023-03-15 11:35:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1895 ms
[2023-03-15 11:35:08] [INFO ] Added : 297 causal constraints over 60 iterations in 13904 ms. Result :sat
Minimization took 3008 ms.
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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Applied a total of 0 rules in 26 ms. Remains 466 /466 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 466/466 places, 461/461 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Applied a total of 0 rules in 16 ms. Remains 466 /466 variables (removed 0) and now considering 461/461 (removed 0) transitions.
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:37:13] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-15 11:37:13] [INFO ] Implicit Places using invariants in 769 ms returned []
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:37:13] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-15 11:37:14] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:37:44] [INFO ] Performed 453/466 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:37:45] [INFO ] Implicit Places using invariants and state equation in 31461 ms returned []
Implicit Place search using SMT with State Equation took 32233 ms to find 0 implicit places.
[2023-03-15 11:37:45] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:37:45] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 11:37:45] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32669 ms. Remains : 466/466 places, 461/461 transitions.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-00
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:37:45] [INFO ] Invariants computation overflowed in 45 ms
Incomplete random walk after 10000 steps, including 1282 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 854 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:37:45] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-15 11:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:37:46] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2023-03-15 11:37:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:37:46] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2023-03-15 11:37:46] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:37:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:37:51] [INFO ] [Nat]Added 73 Read/Feed constraints in 4532 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 464 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 462 transition count 456
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 461 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 17 place count 457 transition count 452
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 455 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 455 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 454 transition count 451
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 454 transition count 446
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 33 place count 449 transition count 446
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 38 place count 449 transition count 446
Applied a total of 38 rules in 95 ms. Remains 449 /466 variables (removed 17) and now considering 446/461 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 449/466 places, 446/461 transitions.
// Phase 1: matrix 446 rows 449 cols
[2023-03-15 11:37:51] [INFO ] Invariants computation overflowed in 30 ms
Incomplete random walk after 1000000 steps, including 128152 resets, run finished after 1119 ms. (steps per millisecond=893 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84923 resets, run finished after 775 ms. (steps per millisecond=1290 ) properties (out of 1) seen :0
// Phase 1: matrix 446 rows 449 cols
[2023-03-15 11:37:53] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:37:54] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2023-03-15 11:37:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:37:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:37:54] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2023-03-15 11:37:54] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:37:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:37:58] [INFO ] [Nat]Added 80 Read/Feed constraints in 3979 ms returned sat
[2023-03-15 11:37:59] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 1 ms to minimize.
[2023-03-15 11:37:59] [INFO ] Deduced a trap composed of 135 places in 356 ms of which 1 ms to minimize.
[2023-03-15 11:37:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 705 ms
[2023-03-15 11:37:59] [INFO ] Computed and/alt/rep : 345/2207/345 causal constraints (skipped 100 transitions) in 36 ms.
[2023-03-15 11:38:12] [INFO ] Added : 225 causal constraints over 45 iterations in 12825 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 446/446 transitions.
Applied a total of 0 rules in 14 ms. Remains 449 /449 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 449/449 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 446/446 transitions.
Applied a total of 0 rules in 13 ms. Remains 449 /449 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 449 cols
[2023-03-15 11:38:42] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:38:42] [INFO ] Implicit Places using invariants in 689 ms returned []
// Phase 1: matrix 446 rows 449 cols
[2023-03-15 11:38:42] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:38:43] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:39:07] [INFO ] Implicit Places using invariants and state equation in 24090 ms returned [13, 228]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 24782 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 447/449 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 447 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 445 transition count 444
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 445 transition count 444
Applied a total of 5 rules in 40 ms. Remains 445 /447 variables (removed 2) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 445 cols
[2023-03-15 11:39:07] [INFO ] Computed 79 place invariants in 68 ms
[2023-03-15 11:39:09] [INFO ] Implicit Places using invariants in 2360 ms returned [43, 49, 69, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 199, 204, 211, 229, 257]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 2362 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 427/449 places, 444/446 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 427 transition count 434
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 417 transition count 434
Applied a total of 20 rules in 27 ms. Remains 417 /427 variables (removed 10) and now considering 434/444 (removed 10) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:39:09] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:39:10] [INFO ] Implicit Places using invariants in 742 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:39:10] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:39:10] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:39:40] [INFO ] Implicit Places using invariants and state equation in 30505 ms returned []
Implicit Place search using SMT with State Equation took 31249 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 417/449 places, 434/446 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 58473 ms. Remains : 417/449 places, 434/446 transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:39:40] [INFO ] Invariants computation overflowed in 37 ms
Incomplete random walk after 1000000 steps, including 144249 resets, run finished after 1216 ms. (steps per millisecond=822 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91329 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:39:42] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:39:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:43] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2023-03-15 11:39:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:39:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:43] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2023-03-15 11:39:43] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:39:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:39:48] [INFO ] [Nat]Added 80 Read/Feed constraints in 5129 ms returned sat
[2023-03-15 11:39:49] [INFO ] Deduced a trap composed of 134 places in 315 ms of which 2 ms to minimize.
[2023-03-15 11:39:49] [INFO ] Deduced a trap composed of 133 places in 456 ms of which 1 ms to minimize.
[2023-03-15 11:39:50] [INFO ] Deduced a trap composed of 12 places in 460 ms of which 1 ms to minimize.
[2023-03-15 11:39:50] [INFO ] Deduced a trap composed of 132 places in 466 ms of which 1 ms to minimize.
[2023-03-15 11:39:51] [INFO ] Deduced a trap composed of 113 places in 458 ms of which 1 ms to minimize.
[2023-03-15 11:39:51] [INFO ] Deduced a trap composed of 134 places in 465 ms of which 1 ms to minimize.
[2023-03-15 11:39:52] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 1 ms to minimize.
[2023-03-15 11:39:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3353 ms
[2023-03-15 11:39:52] [INFO ] Computed and/alt/rep : 326/2143/326 causal constraints (skipped 107 transitions) in 55 ms.
[2023-03-15 11:40:05] [INFO ] Added : 255 causal constraints over 51 iterations in 13559 ms. Result :sat
Minimization took 2151 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 417/417 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:40:38] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:40:38] [INFO ] Implicit Places using invariants in 726 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:40:38] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 11:40:39] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:40:59] [INFO ] Implicit Places using invariants and state equation in 20389 ms returned []
Implicit Place search using SMT with State Equation took 21117 ms to find 0 implicit places.
[2023-03-15 11:40:59] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:40:59] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:40:59] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21728 ms. Remains : 417/417 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-00 in 194060 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-01
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:40:59] [INFO ] Invariants computation overflowed in 62 ms
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 882 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:40:59] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-15 11:41:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:41:00] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2023-03-15 11:41:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:41:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:41:01] [INFO ] [Nat]Absence check using state equation in 1040 ms returned sat
[2023-03-15 11:41:01] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:41:02] [INFO ] [Nat]Added 73 Read/Feed constraints in 302 ms returned sat
[2023-03-15 11:41:02] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 36 ms.
[2023-03-15 11:41:03] [INFO ] Deduced a trap composed of 20 places in 370 ms of which 1 ms to minimize.
[2023-03-15 11:41:03] [INFO ] Deduced a trap composed of 8 places in 345 ms of which 2 ms to minimize.
[2023-03-15 11:41:04] [INFO ] Deduced a trap composed of 15 places in 325 ms of which 1 ms to minimize.
[2023-03-15 11:41:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1246 ms
[2023-03-15 11:41:04] [INFO ] Added : 81 causal constraints over 17 iterations in 2233 ms. Result :sat
Minimization took 900 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 464 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 462 transition count 456
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 461 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 15 place count 458 transition count 453
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 21 place count 455 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 455 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 454 transition count 452
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 454 transition count 446
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 448 transition count 446
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 41 place count 448 transition count 446
Applied a total of 41 rules in 86 ms. Remains 448 /466 variables (removed 18) and now considering 446/461 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 448/466 places, 446/461 transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:41:05] [INFO ] Computed 81 place invariants in 76 ms
Incomplete random walk after 1000000 steps, including 128430 resets, run finished after 1283 ms. (steps per millisecond=779 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84981 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 1) seen :0
[2023-03-15 11:41:07] [INFO ] Invariant cache hit.
[2023-03-15 11:41:07] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 11:41:07] [INFO ] [Real]Absence check using 3 positive and 78 generalized place invariants in 25 ms returned sat
[2023-03-15 11:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:41:08] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-03-15 11:41:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:41:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-15 11:41:08] [INFO ] [Nat]Absence check using 3 positive and 78 generalized place invariants in 48 ms returned sat
[2023-03-15 11:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:41:08] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2023-03-15 11:41:08] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:41:09] [INFO ] [Nat]Added 84 Read/Feed constraints in 529 ms returned sat
[2023-03-15 11:41:09] [INFO ] Computed and/alt/rep : 343/2219/343 causal constraints (skipped 102 transitions) in 55 ms.
[2023-03-15 11:41:11] [INFO ] Deduced a trap composed of 14 places in 614 ms of which 1 ms to minimize.
[2023-03-15 11:41:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 729 ms
[2023-03-15 11:41:11] [INFO ] Added : 64 causal constraints over 14 iterations in 2241 ms. Result :sat
Minimization took 1121 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 12 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 448/448 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 16 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-15 11:41:12] [INFO ] Invariant cache hit.
[2023-03-15 11:41:14] [INFO ] Implicit Places using invariants in 1935 ms returned [45, 51, 71, 76, 98, 103, 123, 129, 150, 155, 156, 176, 181, 202, 207, 214, 228, 233, 261]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1937 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 429/448 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 429 transition count 436
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 419 transition count 436
Applied a total of 20 rules in 30 ms. Remains 419 /429 variables (removed 10) and now considering 436/446 (removed 10) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 11:41:14] [INFO ] Invariants computation overflowed in 79 ms
[2023-03-15 11:41:15] [INFO ] Implicit Places using invariants in 814 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 11:41:15] [INFO ] Invariants computation overflowed in 147 ms
[2023-03-15 11:41:16] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:41:46] [INFO ] Performed 392/419 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 11:41:49] [INFO ] Implicit Places using invariants and state equation in 33888 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 34705 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/448 places, 436/446 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 24 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:41:49] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 11:41:50] [INFO ] Implicit Places using invariants in 577 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:41:50] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:41:50] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:42:03] [INFO ] Implicit Places using invariants and state equation in 13469 ms returned []
Implicit Place search using SMT with State Equation took 14048 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/448 places, 434/446 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 50761 ms. Remains : 416/448 places, 434/446 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:42:03] [INFO ] Invariants computation overflowed in 35 ms
Incomplete random walk after 1000000 steps, including 144063 resets, run finished after 1215 ms. (steps per millisecond=823 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91277 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:42:05] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:42:06] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2023-03-15 11:42:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:42:06] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2023-03-15 11:42:06] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:42:07] [INFO ] [Nat]Added 84 Read/Feed constraints in 240 ms returned sat
[2023-03-15 11:42:07] [INFO ] Computed and/alt/rep : 325/2163/325 causal constraints (skipped 108 transitions) in 39 ms.
[2023-03-15 11:42:08] [INFO ] Deduced a trap composed of 12 places in 494 ms of which 1 ms to minimize.
[2023-03-15 11:42:09] [INFO ] Deduced a trap composed of 10 places in 501 ms of which 1 ms to minimize.
[2023-03-15 11:42:09] [INFO ] Deduced a trap composed of 11 places in 486 ms of which 1 ms to minimize.
[2023-03-15 11:42:10] [INFO ] Deduced a trap composed of 16 places in 399 ms of which 1 ms to minimize.
[2023-03-15 11:42:11] [INFO ] Deduced a trap composed of 16 places in 404 ms of which 1 ms to minimize.
[2023-03-15 11:42:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2989 ms
[2023-03-15 11:42:11] [INFO ] Added : 68 causal constraints over 14 iterations in 4096 ms. Result :sat
Minimization took 1221 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 REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:42:12] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:42:13] [INFO ] Implicit Places using invariants in 727 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:42:13] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 11:42:13] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:42:43] [INFO ] Performed 402/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:42:44] [INFO ] Implicit Places using invariants and state equation in 31352 ms returned []
Implicit Place search using SMT with State Equation took 32081 ms to find 0 implicit places.
[2023-03-15 11:42:44] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:42:44] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 11:42:45] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32674 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-01 in 105490 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-02
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:42:45] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 10000 steps, including 1279 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 832 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:42:45] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:42:46] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2023-03-15 11:42:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:42:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:42:46] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2023-03-15 11:42:46] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:42:47] [INFO ] [Nat]Added 73 Read/Feed constraints in 638 ms returned sat
[2023-03-15 11:42:47] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 62 ms.
[2023-03-15 11:42:50] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 0 ms to minimize.
[2023-03-15 11:42:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-15 11:42:50] [INFO ] Added : 121 causal constraints over 25 iterations in 2829 ms. Result :sat
Minimization took 644 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 464 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 462 transition count 456
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 461 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 457 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 454 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 454 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 453 transition count 451
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 453 transition count 446
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 35 place count 448 transition count 446
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 41 place count 448 transition count 446
Applied a total of 41 rules in 126 ms. Remains 448 /466 variables (removed 18) and now considering 446/461 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 448/466 places, 446/461 transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:42:51] [INFO ] Invariants computation overflowed in 72 ms
Incomplete random walk after 1000000 steps, including 128307 resets, run finished after 1446 ms. (steps per millisecond=691 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84460 resets, run finished after 773 ms. (steps per millisecond=1293 ) properties (out of 1) seen :0
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:42:53] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 11:42:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:42:53] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2023-03-15 11:42:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:42:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:42:54] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2023-03-15 11:42:54] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:42:55] [INFO ] [Nat]Added 84 Read/Feed constraints in 437 ms returned sat
[2023-03-15 11:42:55] [INFO ] Computed and/alt/rep : 346/2238/346 causal constraints (skipped 99 transitions) in 36 ms.
[2023-03-15 11:42:57] [INFO ] Added : 117 causal constraints over 24 iterations in 2053 ms. Result :sat
Minimization took 1191 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 15 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 448/448 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 14 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:42:59] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:43:00] [INFO ] Implicit Places using invariants in 889 ms returned []
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:43:00] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-15 11:43:00] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:43:30] [INFO ] Implicit Places using invariants and state equation in 29980 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 30872 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 447/448 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 447 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 445 transition count 444
Applied a total of 4 rules in 26 ms. Remains 445 /447 variables (removed 2) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 445 cols
[2023-03-15 11:43:30] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 11:43:30] [INFO ] Implicit Places using invariants in 757 ms returned []
// Phase 1: matrix 444 rows 445 cols
[2023-03-15 11:43:30] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-15 11:43:31] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:43:44] [INFO ] Implicit Places using invariants and state equation in 13863 ms returned [48, 68, 73, 94, 99, 119, 125, 146, 151, 178, 199, 204, 211, 225, 258]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 14622 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 430/448 places, 444/446 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 430 transition count 438
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 424 transition count 438
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 424 transition count 438
Applied a total of 16 rules in 38 ms. Remains 424 /430 variables (removed 6) and now considering 438/444 (removed 6) transitions.
// Phase 1: matrix 438 rows 424 cols
[2023-03-15 11:43:44] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:43:45] [INFO ] Implicit Places using invariants in 595 ms returned []
// Phase 1: matrix 438 rows 424 cols
[2023-03-15 11:43:45] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:43:45] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:44:15] [INFO ] Performed 421/424 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:44:16] [INFO ] Implicit Places using invariants and state equation in 30701 ms returned []
Implicit Place search using SMT with State Equation took 31297 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 424/448 places, 438/446 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 76870 ms. Remains : 424/448 places, 438/446 transitions.
// Phase 1: matrix 438 rows 424 cols
[2023-03-15 11:44:16] [INFO ] Invariants computation overflowed in 31 ms
Incomplete random walk after 1000000 steps, including 144196 resets, run finished after 1410 ms. (steps per millisecond=709 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91549 resets, run finished after 914 ms. (steps per millisecond=1094 ) properties (out of 1) seen :0
// Phase 1: matrix 438 rows 424 cols
[2023-03-15 11:44:18] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:44:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:44:19] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2023-03-15 11:44:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:44:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:44:19] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2023-03-15 11:44:19] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:44:20] [INFO ] [Nat]Added 84 Read/Feed constraints in 479 ms returned sat
[2023-03-15 11:44:20] [INFO ] Computed and/alt/rep : 331/2180/331 causal constraints (skipped 106 transitions) in 34 ms.
[2023-03-15 11:44:24] [INFO ] Deduced a trap composed of 11 places in 450 ms of which 1 ms to minimize.
[2023-03-15 11:44:24] [INFO ] Deduced a trap composed of 18 places in 478 ms of which 1 ms to minimize.
[2023-03-15 11:44:25] [INFO ] Deduced a trap composed of 144 places in 482 ms of which 1 ms to minimize.
[2023-03-15 11:44:25] [INFO ] Deduced a trap composed of 142 places in 467 ms of which 1 ms to minimize.
[2023-03-15 11:44:26] [INFO ] Deduced a trap composed of 15 places in 490 ms of which 1 ms to minimize.
[2023-03-15 11:44:26] [INFO ] Deduced a trap composed of 16 places in 492 ms of which 1 ms to minimize.
[2023-03-15 11:44:27] [INFO ] Deduced a trap composed of 137 places in 492 ms of which 1 ms to minimize.
[2023-03-15 11:44:28] [INFO ] Deduced a trap composed of 137 places in 492 ms of which 1 ms to minimize.
[2023-03-15 11:44:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4412 ms
[2023-03-15 11:44:28] [INFO ] Added : 137 causal constraints over 28 iterations in 8071 ms. Result :sat
Minimization took 1257 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 438/438 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 424/424 places, 438/438 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 438/438 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 438/438 (removed 0) transitions.
// Phase 1: matrix 438 rows 424 cols
[2023-03-15 11:44:31] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:44:31] [INFO ] Implicit Places using invariants in 581 ms returned []
// Phase 1: matrix 438 rows 424 cols
[2023-03-15 11:44:31] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 11:44:32] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:44:42] [INFO ] Implicit Places using invariants and state equation in 10373 ms returned []
Implicit Place search using SMT with State Equation took 10955 ms to find 0 implicit places.
[2023-03-15 11:44:42] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 438 rows 424 cols
[2023-03-15 11:44:42] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:44:42] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11334 ms. Remains : 424/424 places, 438/438 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-02 in 117315 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-03
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:44:42] [INFO ] Invariants computation overflowed in 45 ms
Incomplete random walk after 10000 steps, including 1275 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 856 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:44:42] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:44:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:44:43] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2023-03-15 11:44:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:44:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:44:43] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2023-03-15 11:44:43] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:44:43] [INFO ] [Nat]Added 73 Read/Feed constraints in 89 ms returned sat
[2023-03-15 11:44:44] [INFO ] Deduced a trap composed of 14 places in 292 ms of which 1 ms to minimize.
[2023-03-15 11:44:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-15 11:44:44] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 53 ms.
[2023-03-15 11:44:45] [INFO ] Deduced a trap composed of 12 places in 369 ms of which 1 ms to minimize.
[2023-03-15 11:44:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 452 ms
[2023-03-15 11:44:45] [INFO ] Added : 46 causal constraints over 10 iterations in 1111 ms. Result :sat
Minimization took 1609 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 4 place count 464 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 463 transition count 458
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 463 transition count 457
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 15 place count 458 transition count 453
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 21 place count 455 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 455 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 454 transition count 452
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 454 transition count 446
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 448 transition count 446
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 41 place count 448 transition count 446
Applied a total of 41 rules in 73 ms. Remains 448 /466 variables (removed 18) and now considering 446/461 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 448/466 places, 446/461 transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:44:47] [INFO ] Invariants computation overflowed in 40 ms
Incomplete random walk after 1000000 steps, including 127982 resets, run finished after 1275 ms. (steps per millisecond=784 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84771 resets, run finished after 776 ms. (steps per millisecond=1288 ) properties (out of 1) seen :0
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:44:49] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 11:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:44:49] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2023-03-15 11:44:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:44:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:44:50] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2023-03-15 11:44:50] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-15 11:44:51] [INFO ] [Nat]Added 83 Read/Feed constraints in 394 ms returned sat
[2023-03-15 11:44:51] [INFO ] Deduced a trap composed of 13 places in 510 ms of which 1 ms to minimize.
[2023-03-15 11:44:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 578 ms
[2023-03-15 11:44:51] [INFO ] Computed and/alt/rep : 343/2234/343 causal constraints (skipped 102 transitions) in 59 ms.
[2023-03-15 11:44:53] [INFO ] Added : 69 causal constraints over 14 iterations in 2122 ms. Result :sat
Minimization took 723 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 19 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 448/448 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 17 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:44:54] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-15 11:44:55] [INFO ] Implicit Places using invariants in 1007 ms returned []
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:44:55] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-15 11:44:56] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-15 11:45:18] [INFO ] Implicit Places using invariants and state equation in 22314 ms returned [13, 233]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 23324 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 446/448 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 446 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 444 transition count 444
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 444 transition count 444
Applied a total of 5 rules in 31 ms. Remains 444 /446 variables (removed 2) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 444 cols
[2023-03-15 11:45:18] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-15 11:45:18] [INFO ] Implicit Places using invariants in 756 ms returned []
// Phase 1: matrix 444 rows 444 cols
[2023-03-15 11:45:18] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-15 11:45:19] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-15 11:45:39] [INFO ] Implicit Places using invariants and state equation in 20784 ms returned [69, 95, 126, 147, 152, 153, 173, 178, 199, 204, 211, 225]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 21542 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 432/448 places, 444/446 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 432 transition count 439
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 427 transition count 439
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 427 transition count 439
Applied a total of 13 rules in 30 ms. Remains 427 /432 variables (removed 5) and now considering 439/444 (removed 5) transitions.
// Phase 1: matrix 439 rows 427 cols
[2023-03-15 11:45:39] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-15 11:45:40] [INFO ] Implicit Places using invariants in 834 ms returned []
// Phase 1: matrix 439 rows 427 cols
[2023-03-15 11:45:40] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:45:40] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-15 11:46:09] [INFO ] Implicit Places using invariants and state equation in 29076 ms returned []
Implicit Place search using SMT with State Equation took 29912 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 427/448 places, 439/446 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 74857 ms. Remains : 427/448 places, 439/446 transitions.
// Phase 1: matrix 439 rows 427 cols
[2023-03-15 11:46:09] [INFO ] Invariants computation overflowed in 30 ms
Incomplete random walk after 1000000 steps, including 144140 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91388 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 1) seen :0
// Phase 1: matrix 439 rows 427 cols
[2023-03-15 11:46:11] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:46:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:46:12] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2023-03-15 11:46:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:46:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:46:12] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2023-03-15 11:46:12] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-15 11:46:13] [INFO ] [Nat]Added 83 Read/Feed constraints in 410 ms returned sat
[2023-03-15 11:46:13] [INFO ] Deduced a trap composed of 13 places in 318 ms of which 1 ms to minimize.
[2023-03-15 11:46:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2023-03-15 11:46:13] [INFO ] Computed and/alt/rep : 329/2178/329 causal constraints (skipped 109 transitions) in 55 ms.
[2023-03-15 11:46:18] [INFO ] Deduced a trap composed of 113 places in 489 ms of which 1 ms to minimize.
[2023-03-15 11:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 642 ms
[2023-03-15 11:46:18] [INFO ] Added : 117 causal constraints over 24 iterations in 5066 ms. Result :sat
Minimization took 1053 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 439/439 transitions.
Applied a total of 0 rules in 9 ms. Remains 427 /427 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 427/427 places, 439/439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 439/439 transitions.
Applied a total of 0 rules in 10 ms. Remains 427 /427 variables (removed 0) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 427 cols
[2023-03-15 11:46:19] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-15 11:46:20] [INFO ] Implicit Places using invariants in 618 ms returned []
// Phase 1: matrix 439 rows 427 cols
[2023-03-15 11:46:20] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-15 11:46:20] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-15 11:46:48] [INFO ] Implicit Places using invariants and state equation in 28472 ms returned []
Implicit Place search using SMT with State Equation took 29091 ms to find 0 implicit places.
[2023-03-15 11:46:48] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 439 rows 427 cols
[2023-03-15 11:46:48] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:46:49] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29524 ms. Remains : 427/427 places, 439/439 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-03 in 126524 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-04
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:46:49] [INFO ] Invariants computation overflowed in 44 ms
Incomplete random walk after 10000 steps, including 1255 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 856 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:46:49] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:46:49] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2023-03-15 11:46:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:46:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:46:50] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2023-03-15 11:46:50] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:46:51] [INFO ] [Nat]Added 73 Read/Feed constraints in 1100 ms returned sat
[2023-03-15 11:46:51] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 37 ms.
[2023-03-15 11:46:54] [INFO ] Added : 115 causal constraints over 23 iterations in 3325 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 464 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 462 transition count 456
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 461 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 458 transition count 453
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 455 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 455 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 454 transition count 452
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 454 transition count 446
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 448 transition count 446
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 41 place count 448 transition count 446
Applied a total of 41 rules in 83 ms. Remains 448 /466 variables (removed 18) and now considering 446/461 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 448/466 places, 446/461 transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:46:54] [INFO ] Invariants computation overflowed in 35 ms
Incomplete random walk after 1000000 steps, including 128417 resets, run finished after 1199 ms. (steps per millisecond=834 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84493 resets, run finished after 843 ms. (steps per millisecond=1186 ) properties (out of 1) seen :0
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:46:57] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-15 11:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:46:57] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2023-03-15 11:46:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:46:58] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2023-03-15 11:46:58] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:46:59] [INFO ] [Nat]Added 84 Read/Feed constraints in 1035 ms returned sat
[2023-03-15 11:46:59] [INFO ] Computed and/alt/rep : 343/2219/343 causal constraints (skipped 102 transitions) in 37 ms.
[2023-03-15 11:47:12] [INFO ] Deduced a trap composed of 138 places in 362 ms of which 1 ms to minimize.
[2023-03-15 11:47:13] [INFO ] Deduced a trap composed of 147 places in 461 ms of which 0 ms to minimize.
[2023-03-15 11:47:13] [INFO ] Deduced a trap composed of 146 places in 505 ms of which 1 ms to minimize.
[2023-03-15 11:47:14] [INFO ] Deduced a trap composed of 149 places in 545 ms of which 1 ms to minimize.
[2023-03-15 11:47:15] [INFO ] Deduced a trap composed of 143 places in 550 ms of which 1 ms to minimize.
[2023-03-15 11:47:15] [INFO ] Deduced a trap composed of 12 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:47:16] [INFO ] Deduced a trap composed of 146 places in 538 ms of which 1 ms to minimize.
[2023-03-15 11:47:16] [INFO ] Deduced a trap composed of 9 places in 511 ms of which 1 ms to minimize.
[2023-03-15 11:47:17] [INFO ] Deduced a trap composed of 8 places in 533 ms of which 1 ms to minimize.
[2023-03-15 11:47:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5315 ms
[2023-03-15 11:47:17] [INFO ] Added : 301 causal constraints over 61 iterations in 18415 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 11 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 448/448 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 11 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:47:20] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:47:21] [INFO ] Implicit Places using invariants in 662 ms returned []
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:47:21] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:47:21] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:47:51] [INFO ] Performed 399/448 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-15 11:47:55] [INFO ] Implicit Places using invariants and state equation in 33567 ms returned [13, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 34231 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 446/448 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 446 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 444 transition count 444
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 444 transition count 444
Applied a total of 5 rules in 31 ms. Remains 444 /446 variables (removed 2) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 444 cols
[2023-03-15 11:47:55] [INFO ] Computed 79 place invariants in 50 ms
[2023-03-15 11:47:56] [INFO ] Implicit Places using invariants in 1896 ms returned [48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 203, 210, 224, 229, 257]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1904 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 426/448 places, 444/446 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 426 transition count 434
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 416 transition count 434
Applied a total of 20 rules in 31 ms. Remains 416 /426 variables (removed 10) and now considering 434/444 (removed 10) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:47:57] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 11:47:57] [INFO ] Implicit Places using invariants in 799 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:47:57] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 11:47:58] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:48:26] [INFO ] Implicit Places using invariants and state equation in 28653 ms returned []
Implicit Place search using SMT with State Equation took 29454 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/448 places, 434/446 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 65663 ms. Remains : 416/448 places, 434/446 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:48:26] [INFO ] Invariants computation overflowed in 35 ms
Incomplete random walk after 1000000 steps, including 144363 resets, run finished after 1010 ms. (steps per millisecond=990 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91788 resets, run finished after 698 ms. (steps per millisecond=1432 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:48:28] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:48:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:48:28] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2023-03-15 11:48:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:48:29] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2023-03-15 11:48:29] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:48:30] [INFO ] [Nat]Added 84 Read/Feed constraints in 1277 ms returned sat
[2023-03-15 11:48:30] [INFO ] Computed and/alt/rep : 324/2153/324 causal constraints (skipped 109 transitions) in 34 ms.
[2023-03-15 11:48:39] [INFO ] Deduced a trap composed of 147 places in 297 ms of which 1 ms to minimize.
[2023-03-15 11:48:39] [INFO ] Deduced a trap composed of 12 places in 454 ms of which 1 ms to minimize.
[2023-03-15 11:48:40] [INFO ] Deduced a trap composed of 16 places in 445 ms of which 1 ms to minimize.
[2023-03-15 11:48:40] [INFO ] Deduced a trap composed of 134 places in 463 ms of which 1 ms to minimize.
[2023-03-15 11:48:41] [INFO ] Deduced a trap composed of 128 places in 455 ms of which 1 ms to minimize.
[2023-03-15 11:48:41] [INFO ] Deduced a trap composed of 125 places in 431 ms of which 1 ms to minimize.
[2023-03-15 11:48:42] [INFO ] Deduced a trap composed of 16 places in 463 ms of which 1 ms to minimize.
[2023-03-15 11:48:43] [INFO ] Deduced a trap composed of 19 places in 450 ms of which 0 ms to minimize.
[2023-03-15 11:48:43] [INFO ] Deduced a trap composed of 22 places in 422 ms of which 1 ms to minimize.
[2023-03-15 11:48:44] [INFO ] Deduced a trap composed of 137 places in 460 ms of which 1 ms to minimize.
[2023-03-15 11:48:44] [INFO ] Deduced a trap composed of 141 places in 469 ms of which 1 ms to minimize.
[2023-03-15 11:48:45] [INFO ] Deduced a trap composed of 120 places in 459 ms of which 1 ms to minimize.
[2023-03-15 11:48:45] [INFO ] Deduced a trap composed of 127 places in 460 ms of which 1 ms to minimize.
[2023-03-15 11:48:46] [INFO ] Deduced a trap composed of 139 places in 450 ms of which 1 ms to minimize.
[2023-03-15 11:48:47] [INFO ] Deduced a trap composed of 137 places in 465 ms of which 0 ms to minimize.
[2023-03-15 11:48:47] [INFO ] Deduced a trap composed of 130 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:48:48] [INFO ] Deduced a trap composed of 21 places in 456 ms of which 1 ms to minimize.
[2023-03-15 11:48:48] [INFO ] Deduced a trap composed of 139 places in 465 ms of which 1 ms to minimize.
[2023-03-15 11:48:49] [INFO ] Deduced a trap composed of 146 places in 459 ms of which 1 ms to minimize.
[2023-03-15 11:48:49] [INFO ] Deduced a trap composed of 146 places in 413 ms of which 1 ms to minimize.
[2023-03-15 11:48:50] [INFO ] Deduced a trap composed of 139 places in 475 ms of which 1 ms to minimize.
[2023-03-15 11:48:50] [INFO ] Deduced a trap composed of 137 places in 456 ms of which 1 ms to minimize.
[2023-03-15 11:48:51] [INFO ] Deduced a trap composed of 136 places in 442 ms of which 1 ms to minimize.
[2023-03-15 11:48:51] [INFO ] Deduced a trap composed of 133 places in 463 ms of which 1 ms to minimize.
[2023-03-15 11:48:52] [INFO ] Deduced a trap composed of 145 places in 470 ms of which 1 ms to minimize.
[2023-03-15 11:48:53] [INFO ] Deduced a trap composed of 130 places in 444 ms of which 1 ms to minimize.
[2023-03-15 11:48:53] [INFO ] Deduced a trap composed of 139 places in 427 ms of which 1 ms to minimize.
[2023-03-15 11:48:54] [INFO ] Deduced a trap composed of 138 places in 449 ms of which 1 ms to minimize.
[2023-03-15 11:48:54] [INFO ] Deduced a trap composed of 121 places in 471 ms of which 1 ms to minimize.
[2023-03-15 11:48:55] [INFO ] Deduced a trap composed of 142 places in 454 ms of which 1 ms to minimize.
[2023-03-15 11:48:55] [INFO ] Deduced a trap composed of 24 places in 478 ms of which 1 ms to minimize.
[2023-03-15 11:48:56] [INFO ] Deduced a trap composed of 128 places in 451 ms of which 1 ms to minimize.
[2023-03-15 11:48:56] [INFO ] Deduced a trap composed of 19 places in 496 ms of which 1 ms to minimize.
[2023-03-15 11:48:57] [INFO ] Deduced a trap composed of 133 places in 425 ms of which 1 ms to minimize.
[2023-03-15 11:48:58] [INFO ] Deduced a trap composed of 138 places in 458 ms of which 1 ms to minimize.
[2023-03-15 11:48:58] [INFO ] Deduced a trap composed of 130 places in 482 ms of which 1 ms to minimize.
[2023-03-15 11:48:59] [INFO ] Deduced a trap composed of 116 places in 427 ms of which 1 ms to minimize.
[2023-03-15 11:48:59] [INFO ] Deduced a trap composed of 124 places in 385 ms of which 1 ms to minimize.
[2023-03-15 11:49:00] [INFO ] Deduced a trap composed of 125 places in 394 ms of which 1 ms to minimize.
[2023-03-15 11:49:00] [INFO ] Deduced a trap composed of 137 places in 425 ms of which 1 ms to minimize.
[2023-03-15 11:49:01] [INFO ] Deduced a trap composed of 137 places in 246 ms of which 1 ms to minimize.
[2023-03-15 11:49:02] [INFO ] Deduced a trap composed of 24 places in 328 ms of which 1 ms to minimize.
[2023-03-15 11:49:02] [INFO ] Deduced a trap composed of 25 places in 415 ms of which 1 ms to minimize.
[2023-03-15 11:49:03] [INFO ] Deduced a trap composed of 135 places in 465 ms of which 1 ms to minimize.
[2023-03-15 11:49:03] [INFO ] Deduced a trap composed of 25 places in 362 ms of which 3 ms to minimize.
[2023-03-15 11:49:03] [INFO ] Deduced a trap composed of 22 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:49:05] [INFO ] Deduced a trap composed of 127 places in 253 ms of which 1 ms to minimize.
[2023-03-15 11:49:05] [INFO ] Deduced a trap composed of 37 places in 411 ms of which 1 ms to minimize.
[2023-03-15 11:49:06] [INFO ] Deduced a trap composed of 127 places in 459 ms of which 1 ms to minimize.
[2023-03-15 11:49:06] [INFO ] Deduced a trap composed of 135 places in 408 ms of which 0 ms to minimize.
[2023-03-15 11:49:07] [INFO ] Deduced a trap composed of 132 places in 454 ms of which 1 ms to minimize.
[2023-03-15 11:49:07] [INFO ] Deduced a trap composed of 131 places in 456 ms of which 1 ms to minimize.
[2023-03-15 11:49:08] [INFO ] Deduced a trap composed of 27 places in 494 ms of which 1 ms to minimize.
[2023-03-15 11:49:09] [INFO ] Deduced a trap composed of 27 places in 462 ms of which 1 ms to minimize.
[2023-03-15 11:49:09] [INFO ] Deduced a trap composed of 39 places in 456 ms of which 0 ms to minimize.
[2023-03-15 11:49:10] [INFO ] Deduced a trap composed of 39 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:49:10] [INFO ] Deduced a trap composed of 37 places in 463 ms of which 2 ms to minimize.
[2023-03-15 11:49:11] [INFO ] Deduced a trap composed of 129 places in 465 ms of which 1 ms to minimize.
[2023-03-15 11:49:11] [INFO ] Deduced a trap composed of 46 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:49:12] [INFO ] Deduced a trap composed of 49 places in 478 ms of which 1 ms to minimize.
[2023-03-15 11:49:13] [INFO ] Deduced a trap composed of 124 places in 458 ms of which 1 ms to minimize.
[2023-03-15 11:49:13] [INFO ] Deduced a trap composed of 116 places in 465 ms of which 1 ms to minimize.
[2023-03-15 11:49:13] [INFO ] Trap strengthening (SAT) tested/added 62/62 trap constraints in 34974 ms
[2023-03-15 11:49:14] [INFO ] Deduced a trap composed of 2 places in 603 ms of which 1 ms to minimize.
[2023-03-15 11:49:14] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 15 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 15 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:49:14] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 11:49:15] [INFO ] Implicit Places using invariants in 867 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:49:15] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-15 11:49:15] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:49:41] [INFO ] Implicit Places using invariants and state equation in 26105 ms returned []
Implicit Place search using SMT with State Equation took 26974 ms to find 0 implicit places.
[2023-03-15 11:49:41] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:49:41] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 11:49:41] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27420 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-04 in 172760 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-05
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:49:41] [INFO ] Invariants computation overflowed in 72 ms
Incomplete random walk after 10000 steps, including 1279 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:49:42] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-15 11:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:49:43] [INFO ] [Real]Absence check using state equation in 983 ms returned sat
[2023-03-15 11:49:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:49:44] [INFO ] [Nat]Absence check using state equation in 1296 ms returned sat
[2023-03-15 11:49:44] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:49:45] [INFO ] [Nat]Added 73 Read/Feed constraints in 1299 ms returned sat
[2023-03-15 11:49:46] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-15 11:49:46] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 1 ms to minimize.
[2023-03-15 11:49:46] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 1 ms to minimize.
[2023-03-15 11:49:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 867 ms
[2023-03-15 11:49:46] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 46 ms.
[2023-03-15 11:49:48] [INFO ] Deduced a trap composed of 14 places in 291 ms of which 1 ms to minimize.
[2023-03-15 11:49:48] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 464 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 462 transition count 456
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 461 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 457 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 454 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 454 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 453 transition count 451
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 453 transition count 446
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 35 place count 448 transition count 446
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 41 place count 448 transition count 446
Applied a total of 41 rules in 115 ms. Remains 448 /466 variables (removed 18) and now considering 446/461 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 448/466 places, 446/461 transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:49:48] [INFO ] Invariants computation overflowed in 74 ms
Incomplete random walk after 1000000 steps, including 128298 resets, run finished after 1367 ms. (steps per millisecond=731 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84610 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 1) seen :0
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:49:50] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:49:51] [INFO ] [Real]Absence check using state equation in 947 ms returned sat
[2023-03-15 11:49:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:49:52] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2023-03-15 11:49:52] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:49:52] [INFO ] [Nat]Added 84 Read/Feed constraints in 424 ms returned sat
[2023-03-15 11:49:52] [INFO ] Computed and/alt/rep : 346/2238/346 causal constraints (skipped 99 transitions) in 36 ms.
[2023-03-15 11:49:56] [INFO ] Deduced a trap composed of 8 places in 448 ms of which 1 ms to minimize.
[2023-03-15 11:49:57] [INFO ] Deduced a trap composed of 21 places in 601 ms of which 1 ms to minimize.
[2023-03-15 11:49:57] [INFO ] Deduced a trap composed of 126 places in 598 ms of which 1 ms to minimize.
[2023-03-15 11:49:58] [INFO ] Deduced a trap composed of 18 places in 565 ms of which 1 ms to minimize.
[2023-03-15 11:49:59] [INFO ] Deduced a trap composed of 138 places in 593 ms of which 1 ms to minimize.
[2023-03-15 11:49:59] [INFO ] Deduced a trap composed of 20 places in 601 ms of which 1 ms to minimize.
[2023-03-15 11:50:00] [INFO ] Deduced a trap composed of 130 places in 559 ms of which 1 ms to minimize.
[2023-03-15 11:50:01] [INFO ] Deduced a trap composed of 104 places in 579 ms of which 1 ms to minimize.
[2023-03-15 11:50:01] [INFO ] Deduced a trap composed of 143 places in 585 ms of which 1 ms to minimize.
[2023-03-15 11:50:02] [INFO ] Deduced a trap composed of 153 places in 605 ms of which 1 ms to minimize.
[2023-03-15 11:50:03] [INFO ] Deduced a trap composed of 143 places in 602 ms of which 1 ms to minimize.
[2023-03-15 11:50:03] [INFO ] Deduced a trap composed of 136 places in 596 ms of which 1 ms to minimize.
[2023-03-15 11:50:04] [INFO ] Deduced a trap composed of 135 places in 594 ms of which 2 ms to minimize.
[2023-03-15 11:50:05] [INFO ] Deduced a trap composed of 132 places in 598 ms of which 1 ms to minimize.
[2023-03-15 11:50:05] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 9113 ms
[2023-03-15 11:50:05] [INFO ] Added : 116 causal constraints over 24 iterations in 12566 ms. Result :sat
Minimization took 1649 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 10 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 448/448 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 10 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:50:07] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:50:08] [INFO ] Implicit Places using invariants in 1048 ms returned []
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:50:08] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-15 11:50:08] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:50:15] [INFO ] Implicit Places using invariants and state equation in 7681 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8731 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 447/448 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 447 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 445 transition count 444
Applied a total of 4 rules in 22 ms. Remains 445 /447 variables (removed 2) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 445 cols
[2023-03-15 11:50:15] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:50:16] [INFO ] Implicit Places using invariants in 869 ms returned []
// Phase 1: matrix 444 rows 445 cols
[2023-03-15 11:50:16] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 11:50:17] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:50:47] [INFO ] Performed 399/445 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:50:50] [INFO ] Implicit Places using invariants and state equation in 33730 ms returned []
Implicit Place search using SMT with State Equation took 34601 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 445/448 places, 444/446 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43364 ms. Remains : 445/448 places, 444/446 transitions.
// Phase 1: matrix 444 rows 445 cols
[2023-03-15 11:50:50] [INFO ] Invariants computation overflowed in 31 ms
Incomplete random walk after 1000000 steps, including 128204 resets, run finished after 1056 ms. (steps per millisecond=946 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84560 resets, run finished after 766 ms. (steps per millisecond=1305 ) properties (out of 1) seen :0
// Phase 1: matrix 444 rows 445 cols
[2023-03-15 11:50:52] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:50:53] [INFO ] [Real]Absence check using state equation in 1124 ms returned sat
[2023-03-15 11:50:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:50:55] [INFO ] [Nat]Absence check using state equation in 1697 ms returned sat
[2023-03-15 11:50:55] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:50:55] [INFO ] [Nat]Added 84 Read/Feed constraints in 326 ms returned sat
[2023-03-15 11:50:55] [INFO ] Computed and/alt/rep : 344/2226/344 causal constraints (skipped 99 transitions) in 54 ms.
[2023-03-15 11:50:57] [INFO ] Added : 116 causal constraints over 24 iterations in 1807 ms. Result :sat
Minimization took 1506 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 444/444 transitions.
Applied a total of 0 rules in 11 ms. Remains 445 /445 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 445/445 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 444/444 transitions.
Applied a total of 0 rules in 12 ms. Remains 445 /445 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 445 cols
[2023-03-15 11:50:59] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:51:00] [INFO ] Implicit Places using invariants in 725 ms returned []
// Phase 1: matrix 444 rows 445 cols
[2023-03-15 11:51:00] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:51:00] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:51:30] [INFO ] Performed 426/445 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:51:31] [INFO ] Implicit Places using invariants and state equation in 31495 ms returned []
Implicit Place search using SMT with State Equation took 32222 ms to find 0 implicit places.
[2023-03-15 11:51:31] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 444 rows 445 cols
[2023-03-15 11:51:31] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:51:32] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32724 ms. Remains : 445/445 places, 444/444 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-05 in 110102 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-06
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:51:32] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:51:32] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 11:51:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:51:32] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-15 11:51:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:51:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:51:33] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-15 11:51:33] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:51:34] [INFO ] [Nat]Added 73 Read/Feed constraints in 1331 ms returned sat
[2023-03-15 11:51:34] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 1 ms to minimize.
[2023-03-15 11:51:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2023-03-15 11:51:34] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 56 ms.
[2023-03-15 11:51:37] [INFO ] Added : 55 causal constraints over 11 iterations in 2914 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 464 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 462 transition count 456
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 461 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 457 transition count 452
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 455 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 455 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 454 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 454 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 448 transition count 445
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 448 transition count 445
Applied a total of 38 rules in 115 ms. Remains 448 /466 variables (removed 18) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 448/466 places, 445/461 transitions.
// Phase 1: matrix 445 rows 448 cols
[2023-03-15 11:51:37] [INFO ] Computed 81 place invariants in 79 ms
Incomplete random walk after 1000000 steps, including 128439 resets, run finished after 1327 ms. (steps per millisecond=753 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84686 resets, run finished after 978 ms. (steps per millisecond=1022 ) properties (out of 1) seen :0
[2023-03-15 11:51:40] [INFO ] Invariant cache hit.
[2023-03-15 11:51:40] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:51:40] [INFO ] [Real]Absence check using 2 positive and 79 generalized place invariants in 40 ms returned sat
[2023-03-15 11:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:51:40] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2023-03-15 11:51:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:51:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:51:40] [INFO ] [Nat]Absence check using 2 positive and 79 generalized place invariants in 42 ms returned sat
[2023-03-15 11:51:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:51:41] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2023-03-15 11:51:41] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:51:42] [INFO ] [Nat]Added 80 Read/Feed constraints in 1912 ms returned sat
[2023-03-15 11:51:43] [INFO ] Computed and/alt/rep : 349/2233/349 causal constraints (skipped 95 transitions) in 36 ms.
[2023-03-15 11:51:51] [INFO ] Deduced a trap composed of 8 places in 389 ms of which 1 ms to minimize.
[2023-03-15 11:51:51] [INFO ] Deduced a trap composed of 16 places in 585 ms of which 1 ms to minimize.
[2023-03-15 11:51:52] [INFO ] Deduced a trap composed of 18 places in 585 ms of which 1 ms to minimize.
[2023-03-15 11:51:53] [INFO ] Deduced a trap composed of 15 places in 554 ms of which 1 ms to minimize.
[2023-03-15 11:51:53] [INFO ] Deduced a trap composed of 148 places in 493 ms of which 1 ms to minimize.
[2023-03-15 11:51:54] [INFO ] Deduced a trap composed of 146 places in 575 ms of which 1 ms to minimize.
[2023-03-15 11:51:55] [INFO ] Deduced a trap composed of 151 places in 570 ms of which 1 ms to minimize.
[2023-03-15 11:51:55] [INFO ] Deduced a trap composed of 147 places in 554 ms of which 1 ms to minimize.
[2023-03-15 11:51:56] [INFO ] Deduced a trap composed of 149 places in 563 ms of which 1 ms to minimize.
[2023-03-15 11:51:57] [INFO ] Deduced a trap composed of 146 places in 575 ms of which 1 ms to minimize.
[2023-03-15 11:51:57] [INFO ] Deduced a trap composed of 146 places in 556 ms of which 1 ms to minimize.
[2023-03-15 11:51:58] [INFO ] Deduced a trap composed of 143 places in 365 ms of which 0 ms to minimize.
[2023-03-15 11:51:58] [INFO ] Deduced a trap composed of 142 places in 383 ms of which 1 ms to minimize.
[2023-03-15 11:51:59] [INFO ] Deduced a trap composed of 17 places in 366 ms of which 0 ms to minimize.
[2023-03-15 11:51:59] [INFO ] Deduced a trap composed of 116 places in 379 ms of which 2 ms to minimize.
[2023-03-15 11:51:59] [INFO ] Deduced a trap composed of 138 places in 295 ms of which 0 ms to minimize.
[2023-03-15 11:52:00] [INFO ] Deduced a trap composed of 114 places in 353 ms of which 0 ms to minimize.
[2023-03-15 11:52:00] [INFO ] Deduced a trap composed of 151 places in 342 ms of which 1 ms to minimize.
[2023-03-15 11:52:01] [INFO ] Deduced a trap composed of 147 places in 295 ms of which 0 ms to minimize.
[2023-03-15 11:52:01] [INFO ] Deduced a trap composed of 146 places in 358 ms of which 1 ms to minimize.
[2023-03-15 11:52:01] [INFO ] Deduced a trap composed of 118 places in 328 ms of which 1 ms to minimize.
[2023-03-15 11:52:02] [INFO ] Deduced a trap composed of 144 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:52:02] [INFO ] Deduced a trap composed of 102 places in 359 ms of which 0 ms to minimize.
[2023-03-15 11:52:03] [INFO ] Deduced a trap composed of 104 places in 513 ms of which 1 ms to minimize.
[2023-03-15 11:52:04] [INFO ] Deduced a trap composed of 99 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:52:04] [INFO ] Deduced a trap composed of 111 places in 353 ms of which 1 ms to minimize.
[2023-03-15 11:52:04] [INFO ] Deduced a trap composed of 122 places in 379 ms of which 1 ms to minimize.
[2023-03-15 11:52:05] [INFO ] Deduced a trap composed of 154 places in 285 ms of which 1 ms to minimize.
[2023-03-15 11:52:06] [INFO ] Deduced a trap composed of 114 places in 469 ms of which 1 ms to minimize.
[2023-03-15 11:52:06] [INFO ] Deduced a trap composed of 153 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:52:06] [INFO ] Deduced a trap composed of 124 places in 340 ms of which 0 ms to minimize.
[2023-03-15 11:52:07] [INFO ] Deduced a trap composed of 27 places in 343 ms of which 0 ms to minimize.
[2023-03-15 11:52:07] [INFO ] Deduced a trap composed of 43 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:52:08] [INFO ] Deduced a trap composed of 104 places in 331 ms of which 1 ms to minimize.
[2023-03-15 11:52:08] [INFO ] Deduced a trap composed of 148 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:52:09] [INFO ] Deduced a trap composed of 109 places in 437 ms of which 1 ms to minimize.
[2023-03-15 11:52:09] [INFO ] Deduced a trap composed of 106 places in 393 ms of which 1 ms to minimize.
[2023-03-15 11:52:09] [INFO ] Deduced a trap composed of 103 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:52:10] [INFO ] Deduced a trap composed of 153 places in 347 ms of which 0 ms to minimize.
[2023-03-15 11:52:10] [INFO ] Deduced a trap composed of 107 places in 345 ms of which 0 ms to minimize.
[2023-03-15 11:52:11] [INFO ] Deduced a trap composed of 125 places in 340 ms of which 0 ms to minimize.
[2023-03-15 11:52:11] [INFO ] Deduced a trap composed of 149 places in 347 ms of which 0 ms to minimize.
[2023-03-15 11:52:12] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 0 ms to minimize.
[2023-03-15 11:52:12] [INFO ] Deduced a trap composed of 143 places in 284 ms of which 0 ms to minimize.
[2023-03-15 11:52:13] [INFO ] Deduced a trap composed of 122 places in 327 ms of which 1 ms to minimize.
[2023-03-15 11:52:13] [INFO ] Deduced a trap composed of 144 places in 346 ms of which 0 ms to minimize.
[2023-03-15 11:52:13] [INFO ] Deduced a trap composed of 142 places in 339 ms of which 0 ms to minimize.
[2023-03-15 11:52:14] [INFO ] Deduced a trap composed of 143 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:52:14] [INFO ] Deduced a trap composed of 149 places in 343 ms of which 1 ms to minimize.
[2023-03-15 11:52:15] [INFO ] Deduced a trap composed of 156 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:52:15] [INFO ] Deduced a trap composed of 145 places in 333 ms of which 0 ms to minimize.
[2023-03-15 11:52:15] [INFO ] Deduced a trap composed of 151 places in 335 ms of which 1 ms to minimize.
[2023-03-15 11:52:16] [INFO ] Deduced a trap composed of 156 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:52:16] [INFO ] Deduced a trap composed of 154 places in 358 ms of which 1 ms to minimize.
[2023-03-15 11:52:17] [INFO ] Deduced a trap composed of 151 places in 504 ms of which 0 ms to minimize.
[2023-03-15 11:52:17] [INFO ] Deduced a trap composed of 147 places in 406 ms of which 0 ms to minimize.
[2023-03-15 11:52:18] [INFO ] Deduced a trap composed of 139 places in 331 ms of which 1 ms to minimize.
[2023-03-15 11:52:18] [INFO ] Deduced a trap composed of 152 places in 385 ms of which 0 ms to minimize.
[2023-03-15 11:52:19] [INFO ] Deduced a trap composed of 150 places in 370 ms of which 1 ms to minimize.
[2023-03-15 11:52:20] [INFO ] Deduced a trap composed of 98 places in 451 ms of which 0 ms to minimize.
[2023-03-15 11:52:20] [INFO ] Deduced a trap composed of 102 places in 471 ms of which 1 ms to minimize.
[2023-03-15 11:52:21] [INFO ] Deduced a trap composed of 108 places in 360 ms of which 0 ms to minimize.
[2023-03-15 11:52:21] [INFO ] Deduced a trap composed of 105 places in 431 ms of which 1 ms to minimize.
[2023-03-15 11:52:22] [INFO ] Deduced a trap composed of 161 places in 489 ms of which 1 ms to minimize.
[2023-03-15 11:52:22] [INFO ] Deduced a trap composed of 102 places in 474 ms of which 1 ms to minimize.
[2023-03-15 11:52:23] [INFO ] Deduced a trap composed of 109 places in 481 ms of which 1 ms to minimize.
[2023-03-15 11:52:23] [INFO ] Deduced a trap composed of 145 places in 545 ms of which 1 ms to minimize.
[2023-03-15 11:52:24] [INFO ] Deduced a trap composed of 112 places in 523 ms of which 1 ms to minimize.
[2023-03-15 11:52:25] [INFO ] Deduced a trap composed of 160 places in 527 ms of which 1 ms to minimize.
[2023-03-15 11:52:25] [INFO ] Deduced a trap composed of 107 places in 494 ms of which 1 ms to minimize.
[2023-03-15 11:52:25] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 445/445 transitions.
Applied a total of 0 rules in 16 ms. Remains 448 /448 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 448/448 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 445/445 transitions.
Applied a total of 0 rules in 16 ms. Remains 448 /448 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2023-03-15 11:52:25] [INFO ] Invariant cache hit.
[2023-03-15 11:52:28] [INFO ] Implicit Places using invariants in 2375 ms returned [45, 51, 71, 76, 97, 102, 122, 128, 149, 154, 155, 175, 180, 201, 206, 213, 228, 233, 261]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 2377 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 429/448 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 429 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 420 transition count 436
Applied a total of 18 rules in 27 ms. Remains 420 /429 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 420 cols
[2023-03-15 11:52:28] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-15 11:52:28] [INFO ] Implicit Places using invariants in 722 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2023-03-15 11:52:28] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 11:52:29] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:52:56] [INFO ] Implicit Places using invariants and state equation in 27766 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 28489 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/448 places, 436/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 434
Applied a total of 4 rules in 19 ms. Remains 417 /419 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:52:56] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:52:57] [INFO ] Implicit Places using invariants in 539 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:52:57] [INFO ] Invariants computation overflowed in 173 ms
[2023-03-15 11:52:57] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:53:27] [INFO ] Implicit Places using invariants and state equation in 30171 ms returned []
Implicit Place search using SMT with State Equation took 30711 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 417/448 places, 434/445 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 61642 ms. Remains : 417/448 places, 434/445 transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:53:27] [INFO ] Invariants computation overflowed in 65 ms
Incomplete random walk after 1000000 steps, including 144214 resets, run finished after 1213 ms. (steps per millisecond=824 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91179 resets, run finished after 710 ms. (steps per millisecond=1408 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:53:29] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-15 11:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:53:29] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2023-03-15 11:53:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:53:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:53:30] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2023-03-15 11:53:30] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:53:32] [INFO ] [Nat]Added 80 Read/Feed constraints in 1837 ms returned sat
[2023-03-15 11:53:32] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 6 ms to minimize.
[2023-03-15 11:53:32] [INFO ] Deduced a trap composed of 109 places in 343 ms of which 1 ms to minimize.
[2023-03-15 11:53:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 922 ms
[2023-03-15 11:53:33] [INFO ] Computed and/alt/rep : 332/2179/332 causal constraints (skipped 101 transitions) in 49 ms.
[2023-03-15 11:53:38] [INFO ] Deduced a trap composed of 128 places in 297 ms of which 1 ms to minimize.
[2023-03-15 11:53:38] [INFO ] Deduced a trap composed of 125 places in 430 ms of which 1 ms to minimize.
[2023-03-15 11:53:39] [INFO ] Deduced a trap composed of 118 places in 472 ms of which 1 ms to minimize.
[2023-03-15 11:53:39] [INFO ] Deduced a trap composed of 121 places in 454 ms of which 1 ms to minimize.
[2023-03-15 11:53:40] [INFO ] Deduced a trap composed of 130 places in 474 ms of which 1 ms to minimize.
[2023-03-15 11:53:40] [INFO ] Deduced a trap composed of 123 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:53:41] [INFO ] Deduced a trap composed of 125 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:53:42] [INFO ] Deduced a trap composed of 135 places in 487 ms of which 1 ms to minimize.
[2023-03-15 11:53:42] [INFO ] Deduced a trap composed of 130 places in 486 ms of which 1 ms to minimize.
[2023-03-15 11:53:43] [INFO ] Deduced a trap composed of 133 places in 488 ms of which 1 ms to minimize.
[2023-03-15 11:53:43] [INFO ] Deduced a trap composed of 129 places in 484 ms of which 1 ms to minimize.
[2023-03-15 11:53:44] [INFO ] Deduced a trap composed of 122 places in 490 ms of which 1 ms to minimize.
[2023-03-15 11:53:45] [INFO ] Deduced a trap composed of 15 places in 486 ms of which 1 ms to minimize.
[2023-03-15 11:53:45] [INFO ] Deduced a trap composed of 135 places in 492 ms of which 1 ms to minimize.
[2023-03-15 11:53:46] [INFO ] Deduced a trap composed of 12 places in 495 ms of which 1 ms to minimize.
[2023-03-15 11:53:46] [INFO ] Deduced a trap composed of 138 places in 506 ms of which 1 ms to minimize.
[2023-03-15 11:53:47] [INFO ] Deduced a trap composed of 19 places in 475 ms of which 1 ms to minimize.
[2023-03-15 11:53:47] [INFO ] Deduced a trap composed of 123 places in 435 ms of which 2 ms to minimize.
[2023-03-15 11:53:48] [INFO ] Deduced a trap composed of 120 places in 458 ms of which 1 ms to minimize.
[2023-03-15 11:53:49] [INFO ] Deduced a trap composed of 132 places in 430 ms of which 1 ms to minimize.
[2023-03-15 11:53:49] [INFO ] Deduced a trap composed of 136 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:53:50] [INFO ] Deduced a trap composed of 13 places in 484 ms of which 1 ms to minimize.
[2023-03-15 11:53:50] [INFO ] Deduced a trap composed of 130 places in 431 ms of which 1 ms to minimize.
[2023-03-15 11:53:51] [INFO ] Deduced a trap composed of 144 places in 481 ms of which 1 ms to minimize.
[2023-03-15 11:53:52] [INFO ] Deduced a trap composed of 127 places in 480 ms of which 1 ms to minimize.
[2023-03-15 11:53:52] [INFO ] Deduced a trap composed of 145 places in 478 ms of which 1 ms to minimize.
[2023-03-15 11:53:53] [INFO ] Deduced a trap composed of 134 places in 472 ms of which 1 ms to minimize.
[2023-03-15 11:53:53] [INFO ] Deduced a trap composed of 18 places in 478 ms of which 1 ms to minimize.
[2023-03-15 11:53:54] [INFO ] Deduced a trap composed of 134 places in 365 ms of which 1 ms to minimize.
[2023-03-15 11:53:55] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 1 ms to minimize.
[2023-03-15 11:53:55] [INFO ] Deduced a trap composed of 124 places in 321 ms of which 1 ms to minimize.
[2023-03-15 11:53:56] [INFO ] Deduced a trap composed of 16 places in 372 ms of which 1 ms to minimize.
[2023-03-15 11:53:56] [INFO ] Deduced a trap composed of 120 places in 360 ms of which 1 ms to minimize.
[2023-03-15 11:53:57] [INFO ] Deduced a trap composed of 128 places in 375 ms of which 1 ms to minimize.
[2023-03-15 11:53:57] [INFO ] Deduced a trap composed of 129 places in 367 ms of which 0 ms to minimize.
[2023-03-15 11:53:57] [INFO ] Deduced a trap composed of 101 places in 384 ms of which 1 ms to minimize.
[2023-03-15 11:53:58] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 20568 ms
[2023-03-15 11:53:58] [INFO ] Added : 149 causal constraints over 30 iterations in 25392 ms.(timeout) Result :sat
Minimization took 2601 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 417/417 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:54:18] [INFO ] Invariants computation overflowed in 98 ms
[2023-03-15 11:54:19] [INFO ] Implicit Places using invariants in 860 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:54:19] [INFO ] Invariants computation overflowed in 105 ms
[2023-03-15 11:54:20] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:54:50] [INFO ] Performed 413/417 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:54:50] [INFO ] Implicit Places using invariants and state equation in 30695 ms returned []
Implicit Place search using SMT with State Equation took 31555 ms to find 0 implicit places.
[2023-03-15 11:54:50] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:54:50] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-15 11:54:50] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31921 ms. Remains : 417/417 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-06 in 198633 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-07
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:54:50] [INFO ] Invariants computation overflowed in 47 ms
Incomplete random walk after 10000 steps, including 1275 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 874 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:54:50] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-15 11:54:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:54:51] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-15 11:54:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:54:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:54:51] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2023-03-15 11:54:51] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:54:52] [INFO ] [Nat]Added 73 Read/Feed constraints in 806 ms returned sat
[2023-03-15 11:54:52] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 35 ms.
[2023-03-15 11:54:56] [INFO ] Added : 100 causal constraints over 20 iterations in 3650 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 4 place count 464 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 463 transition count 458
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 463 transition count 457
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 15 place count 458 transition count 453
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 21 place count 455 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 455 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 454 transition count 452
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 454 transition count 447
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 33 place count 449 transition count 447
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 39 place count 449 transition count 447
Applied a total of 39 rules in 68 ms. Remains 449 /466 variables (removed 17) and now considering 447/461 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 449/466 places, 447/461 transitions.
// Phase 1: matrix 447 rows 449 cols
[2023-03-15 11:55:26] [INFO ] Invariants computation overflowed in 47 ms
Incomplete random walk after 1000000 steps, including 127990 resets, run finished after 1272 ms. (steps per millisecond=786 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84761 resets, run finished after 770 ms. (steps per millisecond=1298 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 449 cols
[2023-03-15 11:55:28] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 11:55:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:55:28] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2023-03-15 11:55:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:55:29] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2023-03-15 11:55:29] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:55:30] [INFO ] [Nat]Added 84 Read/Feed constraints in 462 ms returned sat
[2023-03-15 11:55:30] [INFO ] Computed and/alt/rep : 344/2232/344 causal constraints (skipped 102 transitions) in 36 ms.
[2023-03-15 11:55:34] [INFO ] Deduced a trap composed of 18 places in 308 ms of which 1 ms to minimize.
[2023-03-15 11:55:34] [INFO ] Deduced a trap composed of 20 places in 300 ms of which 1 ms to minimize.
[2023-03-15 11:55:35] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 1 ms to minimize.
[2023-03-15 11:55:35] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 1 ms to minimize.
[2023-03-15 11:55:36] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 1 ms to minimize.
[2023-03-15 11:55:36] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 1 ms to minimize.
[2023-03-15 11:55:37] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:55:37] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 1 ms to minimize.
[2023-03-15 11:55:37] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 1 ms to minimize.
[2023-03-15 11:55:38] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 1 ms to minimize.
[2023-03-15 11:55:38] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 1 ms to minimize.
[2023-03-15 11:55:38] [INFO ] Deduced a trap composed of 29 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:55:39] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 0 ms to minimize.
[2023-03-15 11:55:39] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 1 ms to minimize.
[2023-03-15 11:55:39] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 1 ms to minimize.
[2023-03-15 11:55:40] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 1 ms to minimize.
[2023-03-15 11:55:40] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 1 ms to minimize.
[2023-03-15 11:55:40] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6529 ms
[2023-03-15 11:55:41] [INFO ] Added : 182 causal constraints over 37 iterations in 10949 ms. Result :sat
Minimization took 2091 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 447/447 transitions.
Applied a total of 0 rules in 11 ms. Remains 449 /449 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 449/449 places, 447/447 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 447/447 transitions.
Applied a total of 0 rules in 11 ms. Remains 449 /449 variables (removed 0) and now considering 447/447 (removed 0) transitions.
// Phase 1: matrix 447 rows 449 cols
[2023-03-15 11:56:13] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 11:56:14] [INFO ] Implicit Places using invariants in 979 ms returned []
// Phase 1: matrix 447 rows 449 cols
[2023-03-15 11:56:14] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-15 11:56:14] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:56:32] [INFO ] Implicit Places using invariants and state equation in 18742 ms returned [13, 260]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 19722 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 447/449 places, 447/447 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 447 transition count 444
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 444 transition count 444
Applied a total of 6 rules in 21 ms. Remains 444 /447 variables (removed 3) and now considering 444/447 (removed 3) transitions.
// Phase 1: matrix 444 rows 444 cols
[2023-03-15 11:56:32] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:56:33] [INFO ] Implicit Places using invariants in 857 ms returned []
// Phase 1: matrix 444 rows 444 cols
[2023-03-15 11:56:33] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-15 11:56:34] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:57:03] [INFO ] Implicit Places using invariants and state equation in 30217 ms returned [42, 68]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 31076 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 442/449 places, 444/447 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 442 transition count 444
Applied a total of 2 rules in 20 ms. Remains 442 /442 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 442 cols
[2023-03-15 11:57:04] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-15 11:57:04] [INFO ] Implicit Places using invariants in 891 ms returned []
// Phase 1: matrix 444 rows 442 cols
[2023-03-15 11:57:04] [INFO ] Invariants computation overflowed in 69 ms
[2023-03-15 11:57:05] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:57:35] [INFO ] Implicit Places using invariants and state equation in 30380 ms returned []
Implicit Place search using SMT with State Equation took 31273 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 442/449 places, 444/447 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 82124 ms. Remains : 442/449 places, 444/447 transitions.
// Phase 1: matrix 444 rows 442 cols
[2023-03-15 11:57:35] [INFO ] Invariants computation overflowed in 41 ms
Incomplete random walk after 1000000 steps, including 128089 resets, run finished after 1261 ms. (steps per millisecond=793 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84691 resets, run finished after 760 ms. (steps per millisecond=1315 ) properties (out of 1) seen :0
// Phase 1: matrix 444 rows 442 cols
[2023-03-15 11:57:37] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-15 11:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:57:37] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2023-03-15 11:57:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:57:38] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2023-03-15 11:57:38] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:57:40] [INFO ] [Nat]Added 84 Read/Feed constraints in 1616 ms returned sat
[2023-03-15 11:57:40] [INFO ] Computed and/alt/rep : 338/2196/338 causal constraints (skipped 105 transitions) in 35 ms.
[2023-03-15 11:57:49] [INFO ] Added : 198 causal constraints over 41 iterations in 8985 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 444/444 transitions.
Applied a total of 0 rules in 11 ms. Remains 442 /442 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 442/442 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 444/444 transitions.
Applied a total of 0 rules in 11 ms. Remains 442 /442 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 442 cols
[2023-03-15 11:57:52] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 11:57:52] [INFO ] Implicit Places using invariants in 652 ms returned []
// Phase 1: matrix 444 rows 442 cols
[2023-03-15 11:57:52] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 11:57:53] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:58:23] [INFO ] Performed 318/442 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 11:58:32] [INFO ] Implicit Places using invariants and state equation in 39174 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 39828 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 441/442 places, 444/444 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 441 transition count 444
Applied a total of 1 rules in 22 ms. Remains 441 /441 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 441 cols
[2023-03-15 11:58:32] [INFO ] Computed 76 place invariants in 52 ms
[2023-03-15 11:58:34] [INFO ] Implicit Places using invariants in 1981 ms returned [47, 71, 92, 97, 117, 123, 144, 149, 150, 174, 195, 200, 207, 221, 226]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1983 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 426/442 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 426 transition count 435
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 417 transition count 435
Applied a total of 18 rules in 26 ms. Remains 417 /426 variables (removed 9) and now considering 435/444 (removed 9) transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:58:34] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:58:34] [INFO ] Implicit Places using invariants in 789 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:58:34] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-15 11:58:35] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:59:00] [INFO ] Implicit Places using invariants and state equation in 25715 ms returned []
Implicit Place search using SMT with State Equation took 26504 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 417/442 places, 435/444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 68374 ms. Remains : 417/442 places, 435/444 transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:59:00] [INFO ] Invariants computation overflowed in 32 ms
Incomplete random walk after 1000000 steps, including 144374 resets, run finished after 1204 ms. (steps per millisecond=830 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91189 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:59:02] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:59:02] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2023-03-15 11:59:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:59:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:59:03] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2023-03-15 11:59:03] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:59:04] [INFO ] [Nat]Added 84 Read/Feed constraints in 561 ms returned sat
[2023-03-15 11:59:04] [INFO ] Computed and/alt/rep : 325/2166/325 causal constraints (skipped 109 transitions) in 33 ms.
[2023-03-15 11:59:09] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 2 ms to minimize.
[2023-03-15 11:59:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 439 ms
[2023-03-15 11:59:09] [INFO ] Added : 167 causal constraints over 35 iterations in 5595 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 417/417 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:59:12] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:59:13] [INFO ] Implicit Places using invariants in 591 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:59:13] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-15 11:59:13] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:59:44] [INFO ] Performed 370/417 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:59:48] [INFO ] Implicit Places using invariants and state equation in 34694 ms returned []
Implicit Place search using SMT with State Equation took 35286 ms to find 0 implicit places.
[2023-03-15 11:59:48] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:59:48] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:59:48] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35884 ms. Remains : 417/417 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-07 in 298099 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-08
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:59:48] [INFO ] Invariants computation overflowed in 45 ms
Incomplete random walk after 10000 steps, including 1316 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 847 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 11:59:48] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:59:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:59:49] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2023-03-15 11:59:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:59:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:59:49] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2023-03-15 11:59:49] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:59:50] [INFO ] [Nat]Added 73 Read/Feed constraints in 360 ms returned sat
[2023-03-15 11:59:50] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 36 ms.
[2023-03-15 11:59:54] [INFO ] Deduced a trap composed of 3 places in 285 ms of which 1 ms to minimize.
[2023-03-15 11:59:54] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 464 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 462 transition count 456
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 461 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 17 place count 457 transition count 452
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 23 place count 454 transition count 452
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 454 transition count 446
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 35 place count 448 transition count 446
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 41 place count 448 transition count 446
Applied a total of 41 rules in 58 ms. Remains 448 /466 variables (removed 18) and now considering 446/461 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 448/466 places, 446/461 transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:59:54] [INFO ] Computed 81 place invariants in 57 ms
Incomplete random walk after 1000000 steps, including 128623 resets, run finished after 1211 ms. (steps per millisecond=825 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85028 resets, run finished after 782 ms. (steps per millisecond=1278 ) properties (out of 1) seen :0
[2023-03-15 11:59:56] [INFO ] Invariant cache hit.
[2023-03-15 11:59:56] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:59:56] [INFO ] [Real]Absence check using 2 positive and 79 generalized place invariants in 50 ms returned sat
[2023-03-15 11:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:59:57] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2023-03-15 11:59:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:59:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:59:57] [INFO ] [Nat]Absence check using 2 positive and 79 generalized place invariants in 53 ms returned sat
[2023-03-15 11:59:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:59:57] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2023-03-15 11:59:57] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:59:57] [INFO ] [Nat]Added 84 Read/Feed constraints in 386 ms returned sat
[2023-03-15 11:59:58] [INFO ] Computed and/alt/rep : 343/2227/343 causal constraints (skipped 102 transitions) in 36 ms.
[2023-03-15 12:00:01] [INFO ] Deduced a trap composed of 20 places in 375 ms of which 1 ms to minimize.
[2023-03-15 12:00:02] [INFO ] Deduced a trap composed of 16 places in 356 ms of which 1 ms to minimize.
[2023-03-15 12:00:02] [INFO ] Deduced a trap composed of 87 places in 319 ms of which 1 ms to minimize.
[2023-03-15 12:00:03] [INFO ] Deduced a trap composed of 28 places in 309 ms of which 1 ms to minimize.
[2023-03-15 12:00:03] [INFO ] Deduced a trap composed of 18 places in 329 ms of which 1 ms to minimize.
[2023-03-15 12:00:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2356 ms
[2023-03-15 12:00:03] [INFO ] Added : 149 causal constraints over 30 iterations in 5715 ms. Result :sat
Minimization took 1422 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 11 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 448/448 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 11 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-15 12:00:35] [INFO ] Invariant cache hit.
[2023-03-15 12:00:37] [INFO ] Implicit Places using invariants in 2325 ms returned [45, 51, 71, 76, 97, 102, 122, 128, 149, 154, 155, 175, 180, 201, 207, 214, 228, 233, 261]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 2327 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 429/448 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 429 transition count 436
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 419 transition count 436
Applied a total of 20 rules in 24 ms. Remains 419 /429 variables (removed 10) and now considering 436/446 (removed 10) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 12:00:37] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 12:00:38] [INFO ] Implicit Places using invariants in 634 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 12:00:38] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 12:00:38] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:01:08] [INFO ] Performed 350/419 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 12:01:14] [INFO ] Implicit Places using invariants and state equation in 35919 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 36555 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/448 places, 436/446 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 18 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:01:14] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 12:01:14] [INFO ] Implicit Places using invariants in 525 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:01:14] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 12:01:15] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:01:45] [INFO ] Performed 397/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 12:01:46] [INFO ] Implicit Places using invariants and state equation in 31821 ms returned []
Implicit Place search using SMT with State Equation took 32347 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/448 places, 434/446 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 71284 ms. Remains : 416/448 places, 434/446 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:01:46] [INFO ] Invariants computation overflowed in 37 ms
Incomplete random walk after 1000000 steps, including 144094 resets, run finished after 1021 ms. (steps per millisecond=979 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91300 resets, run finished after 713 ms. (steps per millisecond=1402 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:01:48] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 12:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:01:48] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-15 12:01:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:01:49] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2023-03-15 12:01:49] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:01:50] [INFO ] [Nat]Added 84 Read/Feed constraints in 507 ms returned sat
[2023-03-15 12:01:50] [INFO ] Computed and/alt/rep : 324/2161/324 causal constraints (skipped 109 transitions) in 33 ms.
[2023-03-15 12:01:56] [INFO ] Deduced a trap composed of 8 places in 332 ms of which 1 ms to minimize.
[2023-03-15 12:01:56] [INFO ] Deduced a trap composed of 21 places in 296 ms of which 1 ms to minimize.
[2023-03-15 12:01:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 816 ms
[2023-03-15 12:01:56] [INFO ] Added : 150 causal constraints over 30 iterations in 6692 ms. Result :sat
Minimization took 1897 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 REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:02:09] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 12:02:10] [INFO ] Implicit Places using invariants in 516 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:02:10] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 12:02:10] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:02:37] [INFO ] Implicit Places using invariants and state equation in 27401 ms returned []
Implicit Place search using SMT with State Equation took 27918 ms to find 0 implicit places.
[2023-03-15 12:02:37] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:02:37] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 12:02:38] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28339 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-08 in 169302 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-09
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:02:38] [INFO ] Invariants computation overflowed in 52 ms
Incomplete random walk after 10000 steps, including 1282 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 855 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:02:38] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-15 12:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:02:38] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2023-03-15 12:02:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:02:39] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2023-03-15 12:02:39] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 12:02:40] [INFO ] [Nat]Added 73 Read/Feed constraints in 1111 ms returned sat
[2023-03-15 12:02:40] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 36 ms.
[2023-03-15 12:02:43] [INFO ] Deduced a trap composed of 11 places in 398 ms of which 1 ms to minimize.
[2023-03-15 12:02:43] [INFO ] Deduced a trap composed of 15 places in 337 ms of which 1 ms to minimize.
[2023-03-15 12:02:44] [INFO ] Deduced a trap composed of 16 places in 311 ms of which 1 ms to minimize.
[2023-03-15 12:02:44] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 464 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 462 transition count 456
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 461 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 457 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 454 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 454 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 453 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 453 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 37 place count 447 transition count 445
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 42 place count 447 transition count 445
Applied a total of 42 rules in 110 ms. Remains 447 /466 variables (removed 19) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 447/466 places, 445/461 transitions.
// Phase 1: matrix 445 rows 447 cols
[2023-03-15 12:02:44] [INFO ] Computed 81 place invariants in 96 ms
Incomplete random walk after 1000000 steps, including 128515 resets, run finished after 1443 ms. (steps per millisecond=693 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84581 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 1) seen :0
[2023-03-15 12:02:46] [INFO ] Invariant cache hit.
[2023-03-15 12:02:46] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 12:02:46] [INFO ] [Real]Absence check using 2 positive and 79 generalized place invariants in 31 ms returned sat
[2023-03-15 12:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:02:46] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2023-03-15 12:02:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:02:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-15 12:02:47] [INFO ] [Nat]Absence check using 2 positive and 79 generalized place invariants in 48 ms returned sat
[2023-03-15 12:02:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:02:47] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2023-03-15 12:02:47] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:02:47] [INFO ] [Nat]Added 84 Read/Feed constraints in 144 ms returned sat
[2023-03-15 12:02:47] [INFO ] Computed and/alt/rep : 342/2220/342 causal constraints (skipped 102 transitions) in 35 ms.
[2023-03-15 12:02:54] [INFO ] Added : 30 causal constraints over 6 iterations in 6647 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 447 /447 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 447/447 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 447 /447 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2023-03-15 12:02:54] [INFO ] Invariant cache hit.
[2023-03-15 12:02:56] [INFO ] Implicit Places using invariants in 2423 ms returned [45, 51, 71, 76, 97, 102, 122, 128, 149, 154, 155, 175, 180, 201, 206, 213, 227, 232, 260]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 2426 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 428/447 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 428 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 419 transition count 436
Applied a total of 18 rules in 28 ms. Remains 419 /428 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 12:02:57] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-15 12:02:57] [INFO ] Implicit Places using invariants in 852 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 12:02:57] [INFO ] Invariants computation overflowed in 85 ms
[2023-03-15 12:02:58] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:03:26] [INFO ] Implicit Places using invariants and state equation in 28817 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 29671 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/447 places, 436/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 18 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:03:26] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 12:03:27] [INFO ] Implicit Places using invariants in 525 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:03:27] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 12:03:27] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:03:54] [INFO ] Implicit Places using invariants and state equation in 27254 ms returned []
Implicit Place search using SMT with State Equation took 27781 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/447 places, 434/445 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 59934 ms. Remains : 416/447 places, 434/445 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:03:54] [INFO ] Invariants computation overflowed in 50 ms
Incomplete random walk after 1000000 steps, including 143886 resets, run finished after 1213 ms. (steps per millisecond=824 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91364 resets, run finished after 843 ms. (steps per millisecond=1186 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:03:56] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-15 12:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:57] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2023-03-15 12:03:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:58] [INFO ] [Nat]Absence check using state equation in 744 ms returned sat
[2023-03-15 12:03:58] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:03:58] [INFO ] [Nat]Added 84 Read/Feed constraints in 213 ms returned sat
[2023-03-15 12:03:58] [INFO ] Computed and/alt/rep : 327/2181/327 causal constraints (skipped 106 transitions) in 32 ms.
[2023-03-15 12:04:03] [INFO ] Deduced a trap composed of 9 places in 318 ms of which 1 ms to minimize.
[2023-03-15 12:04:04] [INFO ] Deduced a trap composed of 10 places in 419 ms of which 1 ms to minimize.
[2023-03-15 12:04:04] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 1 ms to minimize.
[2023-03-15 12:04:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1348 ms
[2023-03-15 12:04:04] [INFO ] Added : 113 causal constraints over 23 iterations in 6476 ms. Result :sat
Minimization took 1327 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 REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:04:06] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-15 12:04:07] [INFO ] Implicit Places using invariants in 679 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:04:07] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-15 12:04:07] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:04:37] [INFO ] Implicit Places using invariants and state equation in 30097 ms returned []
Implicit Place search using SMT with State Equation took 30776 ms to find 0 implicit places.
[2023-03-15 12:04:37] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:04:37] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 12:04:37] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31131 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-09 in 119557 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-10
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:04:37] [INFO ] Invariants computation overflowed in 45 ms
Incomplete random walk after 10000 steps, including 1292 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 846 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:04:37] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 12:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:04:38] [INFO ] [Real]Absence check using state equation in 695 ms returned sat
[2023-03-15 12:04:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:04:39] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2023-03-15 12:04:39] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 12:04:39] [INFO ] [Nat]Added 73 Read/Feed constraints in 811 ms returned sat
[2023-03-15 12:04:39] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 36 ms.
[2023-03-15 12:04:43] [INFO ] Added : 195 causal constraints over 39 iterations in 3668 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 464 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 462 transition count 456
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 461 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 15 place count 458 transition count 453
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 21 place count 455 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 455 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 454 transition count 452
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 454 transition count 446
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 448 transition count 446
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 41 place count 448 transition count 446
Applied a total of 41 rules in 69 ms. Remains 448 /466 variables (removed 18) and now considering 446/461 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 448/466 places, 446/461 transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 12:05:13] [INFO ] Computed 81 place invariants in 59 ms
Incomplete random walk after 1000000 steps, including 128365 resets, run finished after 1270 ms. (steps per millisecond=787 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84760 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 1) seen :0
[2023-03-15 12:05:15] [INFO ] Invariant cache hit.
[2023-03-15 12:05:15] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-15 12:05:15] [INFO ] [Real]Absence check using 2 positive and 79 generalized place invariants in 46 ms returned sat
[2023-03-15 12:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:16] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2023-03-15 12:05:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 12:05:16] [INFO ] [Nat]Absence check using 2 positive and 79 generalized place invariants in 31 ms returned sat
[2023-03-15 12:05:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:16] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2023-03-15 12:05:16] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:05:17] [INFO ] [Nat]Added 84 Read/Feed constraints in 653 ms returned sat
[2023-03-15 12:05:17] [INFO ] Computed and/alt/rep : 344/2228/344 causal constraints (skipped 101 transitions) in 35 ms.
[2023-03-15 12:05:23] [INFO ] Added : 206 causal constraints over 42 iterations in 6046 ms. Result :sat
Minimization took 2328 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 10 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 448/448 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 10 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-15 12:05:55] [INFO ] Invariant cache hit.
[2023-03-15 12:05:57] [INFO ] Implicit Places using invariants in 1604 ms returned [45, 51, 71, 76, 97, 102, 122, 128, 149, 154, 155, 175, 180, 201, 206, 213, 227, 232, 260]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1607 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 429/448 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 429 transition count 436
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 419 transition count 436
Applied a total of 20 rules in 29 ms. Remains 419 /429 variables (removed 10) and now considering 436/446 (removed 10) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 12:05:57] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 12:05:58] [INFO ] Implicit Places using invariants in 785 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 12:05:58] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-15 12:05:58] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:06:20] [INFO ] Implicit Places using invariants and state equation in 22601 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 23388 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/448 places, 436/446 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 18 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:06:20] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 12:06:21] [INFO ] Implicit Places using invariants in 558 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:06:21] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 12:06:21] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:06:39] [INFO ] Implicit Places using invariants and state equation in 18519 ms returned []
Implicit Place search using SMT with State Equation took 19079 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/448 places, 434/446 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 44131 ms. Remains : 416/448 places, 434/446 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:06:39] [INFO ] Invariants computation overflowed in 31 ms
Incomplete random walk after 1000000 steps, including 144180 resets, run finished after 1010 ms. (steps per millisecond=990 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91656 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:06:41] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 12:06:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:06:42] [INFO ] [Real]Absence check using state equation in 550 ms returned sat
[2023-03-15 12:06:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:06:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:06:43] [INFO ] [Nat]Absence check using state equation in 864 ms returned sat
[2023-03-15 12:06:43] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:06:43] [INFO ] [Nat]Added 84 Read/Feed constraints in 641 ms returned sat
[2023-03-15 12:06:43] [INFO ] Computed and/alt/rep : 325/2162/325 causal constraints (skipped 108 transitions) in 33 ms.
[2023-03-15 12:06:52] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2023-03-15 12:06:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2023-03-15 12:06:52] [INFO ] Added : 195 causal constraints over 39 iterations in 8586 ms. Result :sat
Minimization took 2181 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 REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:07:24] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 12:07:25] [INFO ] Implicit Places using invariants in 523 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:07:25] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 12:07:25] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:07:53] [INFO ] Implicit Places using invariants and state equation in 28725 ms returned []
Implicit Place search using SMT with State Equation took 29250 ms to find 0 implicit places.
[2023-03-15 12:07:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 12:07:54] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 12:07:54] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29614 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-10 in 196739 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-11
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:07:54] [INFO ] Invariants computation overflowed in 48 ms
Incomplete random walk after 10000 steps, including 1256 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 848 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:07:54] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-15 12:07:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:07:54] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2023-03-15 12:07:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:07:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:07:56] [INFO ] [Nat]Absence check using state equation in 868 ms returned sat
[2023-03-15 12:07:56] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 12:07:58] [INFO ] [Nat]Added 73 Read/Feed constraints in 2029 ms returned sat
[2023-03-15 12:07:58] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2023-03-15 12:07:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-15 12:07:58] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 43 ms.
[2023-03-15 12:08:00] [INFO ] Added : 45 causal constraints over 9 iterations in 1832 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 465 transition count 458
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 463 transition count 458
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 463 transition count 457
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 462 transition count 457
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 16 place count 458 transition count 453
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 455 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 455 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 454 transition count 452
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 454 transition count 446
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 36 place count 448 transition count 446
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 41 place count 448 transition count 446
Applied a total of 41 rules in 70 ms. Remains 448 /466 variables (removed 18) and now considering 446/461 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 448/466 places, 446/461 transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 12:08:00] [INFO ] Invariants computation overflowed in 29 ms
Incomplete random walk after 1000000 steps, including 128130 resets, run finished after 1281 ms. (steps per millisecond=780 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85099 resets, run finished after 776 ms. (steps per millisecond=1288 ) properties (out of 1) seen :0
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 12:08:02] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 12:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:03] [INFO ] [Real]Absence check using state equation in 695 ms returned sat
[2023-03-15 12:08:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:04] [INFO ] [Nat]Absence check using state equation in 1819 ms returned sat
[2023-03-15 12:08:04] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:08:07] [INFO ] [Nat]Added 84 Read/Feed constraints in 2408 ms returned sat
[2023-03-15 12:08:07] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-15 12:08:07] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2023-03-15 12:08:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2023-03-15 12:08:07] [INFO ] Computed and/alt/rep : 344/2241/344 causal constraints (skipped 101 transitions) in 35 ms.
[2023-03-15 12:08:16] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 1 ms to minimize.
[2023-03-15 12:08:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-15 12:08:16] [INFO ] Added : 219 causal constraints over 44 iterations in 8945 ms. Result :sat
Minimization took 2656 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 10 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 448/448 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 10 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 12:08:49] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 12:08:50] [INFO ] Implicit Places using invariants in 789 ms returned []
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 12:08:50] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-15 12:08:50] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:09:15] [INFO ] Implicit Places using invariants and state equation in 25545 ms returned [13, 214, 261]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 26337 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 445/448 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 445 transition count 443
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 442 transition count 443
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 442 transition count 443
Applied a total of 7 rules in 33 ms. Remains 442 /445 variables (removed 3) and now considering 443/446 (removed 3) transitions.
// Phase 1: matrix 443 rows 442 cols
[2023-03-15 12:09:15] [INFO ] Computed 78 place invariants in 62 ms
[2023-03-15 12:09:16] [INFO ] Implicit Places using invariants in 744 ms returned []
[2023-03-15 12:09:16] [INFO ] Invariant cache hit.
[2023-03-15 12:09:16] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:09:47] [INFO ] Performed 326/442 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-15 12:09:54] [INFO ] Implicit Places using invariants and state equation in 38515 ms returned [43, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 39260 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 440/448 places, 443/446 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 440 transition count 443
Applied a total of 2 rules in 20 ms. Remains 440 /440 variables (removed 0) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 440 cols
[2023-03-15 12:09:55] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 12:09:55] [INFO ] Implicit Places using invariants in 875 ms returned []
// Phase 1: matrix 443 rows 440 cols
[2023-03-15 12:09:55] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-15 12:09:56] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:10:22] [INFO ] Implicit Places using invariants and state equation in 26493 ms returned []
Implicit Place search using SMT with State Equation took 27370 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 440/448 places, 443/446 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 93032 ms. Remains : 440/448 places, 443/446 transitions.
// Phase 1: matrix 443 rows 440 cols
[2023-03-15 12:10:22] [INFO ] Invariants computation overflowed in 34 ms
Incomplete random walk after 1000000 steps, including 129630 resets, run finished after 1258 ms. (steps per millisecond=794 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85094 resets, run finished after 756 ms. (steps per millisecond=1322 ) properties (out of 1) seen :0
// Phase 1: matrix 443 rows 440 cols
[2023-03-15 12:10:24] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 12:10:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:10:24] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2023-03-15 12:10:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:10:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:10:25] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2023-03-15 12:10:25] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:10:27] [INFO ] [Nat]Added 84 Read/Feed constraints in 1701 ms returned sat
[2023-03-15 12:10:27] [INFO ] Computed and/alt/rep : 339/2209/339 causal constraints (skipped 103 transitions) in 53 ms.
[2023-03-15 12:10:37] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-15 12:10:37] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 1 ms to minimize.
[2023-03-15 12:10:38] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 1 ms to minimize.
[2023-03-15 12:10:38] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2023-03-15 12:10:38] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 1 ms to minimize.
[2023-03-15 12:10:39] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 0 ms to minimize.
[2023-03-15 12:10:39] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 1 ms to minimize.
[2023-03-15 12:10:39] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 1 ms to minimize.
[2023-03-15 12:10:40] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 1 ms to minimize.
[2023-03-15 12:10:40] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 1 ms to minimize.
[2023-03-15 12:10:40] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 1 ms to minimize.
[2023-03-15 12:10:41] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 0 ms to minimize.
[2023-03-15 12:10:41] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 1 ms to minimize.
[2023-03-15 12:10:41] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 0 ms to minimize.
[2023-03-15 12:10:41] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 0 ms to minimize.
[2023-03-15 12:10:41] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 1 ms to minimize.
[2023-03-15 12:10:42] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 0 ms to minimize.
[2023-03-15 12:10:42] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 1 ms to minimize.
[2023-03-15 12:10:43] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 1 ms to minimize.
[2023-03-15 12:10:43] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5869 ms
[2023-03-15 12:10:43] [INFO ] Added : 228 causal constraints over 46 iterations in 15950 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 443/443 transitions.
Applied a total of 0 rules in 11 ms. Remains 440 /440 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 440/440 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 443/443 transitions.
Applied a total of 0 rules in 12 ms. Remains 440 /440 variables (removed 0) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 440 cols
[2023-03-15 12:10:46] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 12:10:47] [INFO ] Implicit Places using invariants in 662 ms returned []
// Phase 1: matrix 443 rows 440 cols
[2023-03-15 12:10:47] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-15 12:10:47] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:11:15] [INFO ] Implicit Places using invariants and state equation in 27971 ms returned []
Implicit Place search using SMT with State Equation took 28634 ms to find 0 implicit places.
[2023-03-15 12:11:15] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 443 rows 440 cols
[2023-03-15 12:11:15] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 12:11:15] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29013 ms. Remains : 440/440 places, 443/443 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-11 in 201054 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-12
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:11:15] [INFO ] Invariants computation overflowed in 45 ms
Incomplete random walk after 10000 steps, including 1249 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 875 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:11:15] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 12:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:11:16] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2023-03-15 12:11:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:11:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:11:16] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2023-03-15 12:11:16] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 12:11:17] [INFO ] [Nat]Added 73 Read/Feed constraints in 700 ms returned sat
[2023-03-15 12:11:17] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 0 ms to minimize.
[2023-03-15 12:11:17] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 0 ms to minimize.
[2023-03-15 12:11:17] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 0 ms to minimize.
[2023-03-15 12:11:17] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2023-03-15 12:11:18] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 0 ms to minimize.
[2023-03-15 12:11:18] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 0 ms to minimize.
[2023-03-15 12:11:18] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
[2023-03-15 12:11:18] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2023-03-15 12:11:18] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2023-03-15 12:11:18] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 1 ms to minimize.
[2023-03-15 12:11:19] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2023-03-15 12:11:19] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2023-03-15 12:11:19] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2023-03-15 12:11:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2118 ms
[2023-03-15 12:11:19] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 35 ms.
[2023-03-15 12:11:21] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 0 ms to minimize.
[2023-03-15 12:11:21] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 464 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 462 transition count 456
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 461 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 17 place count 457 transition count 452
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 23 place count 454 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 454 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 453 transition count 451
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 29 place count 453 transition count 447
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 33 place count 449 transition count 447
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 39 place count 449 transition count 447
Applied a total of 39 rules in 70 ms. Remains 449 /466 variables (removed 17) and now considering 447/461 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 449/466 places, 447/461 transitions.
// Phase 1: matrix 447 rows 449 cols
[2023-03-15 12:11:21] [INFO ] Invariants computation overflowed in 47 ms
Incomplete random walk after 1000000 steps, including 128296 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84855 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 1) seen :0
// Phase 1: matrix 447 rows 449 cols
[2023-03-15 12:11:23] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 12:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:11:24] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2023-03-15 12:11:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:11:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:11:24] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2023-03-15 12:11:24] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:11:26] [INFO ] [Nat]Added 84 Read/Feed constraints in 1644 ms returned sat
[2023-03-15 12:11:26] [INFO ] Computed and/alt/rep : 344/2228/344 causal constraints (skipped 102 transitions) in 37 ms.
[2023-03-15 12:11:30] [INFO ] Deduced a trap composed of 142 places in 312 ms of which 0 ms to minimize.
[2023-03-15 12:11:31] [INFO ] Deduced a trap composed of 138 places in 414 ms of which 0 ms to minimize.
[2023-03-15 12:11:31] [INFO ] Deduced a trap composed of 114 places in 405 ms of which 1 ms to minimize.
[2023-03-15 12:11:32] [INFO ] Deduced a trap composed of 141 places in 393 ms of which 1 ms to minimize.
[2023-03-15 12:11:32] [INFO ] Deduced a trap composed of 18 places in 399 ms of which 0 ms to minimize.
[2023-03-15 12:11:32] [INFO ] Deduced a trap composed of 16 places in 300 ms of which 1 ms to minimize.
[2023-03-15 12:11:33] [INFO ] Deduced a trap composed of 139 places in 396 ms of which 1 ms to minimize.
[2023-03-15 12:11:33] [INFO ] Deduced a trap composed of 134 places in 385 ms of which 1 ms to minimize.
[2023-03-15 12:11:34] [INFO ] Deduced a trap composed of 136 places in 390 ms of which 0 ms to minimize.
[2023-03-15 12:11:34] [INFO ] Deduced a trap composed of 147 places in 398 ms of which 0 ms to minimize.
[2023-03-15 12:11:35] [INFO ] Deduced a trap composed of 145 places in 400 ms of which 1 ms to minimize.
[2023-03-15 12:11:35] [INFO ] Deduced a trap composed of 151 places in 390 ms of which 1 ms to minimize.
[2023-03-15 12:11:36] [INFO ] Deduced a trap composed of 155 places in 386 ms of which 1 ms to minimize.
[2023-03-15 12:11:36] [INFO ] Deduced a trap composed of 139 places in 386 ms of which 1 ms to minimize.
[2023-03-15 12:11:36] [INFO ] Deduced a trap composed of 150 places in 393 ms of which 1 ms to minimize.
[2023-03-15 12:11:37] [INFO ] Deduced a trap composed of 150 places in 306 ms of which 1 ms to minimize.
[2023-03-15 12:11:37] [INFO ] Deduced a trap composed of 164 places in 389 ms of which 1 ms to minimize.
[2023-03-15 12:11:38] [INFO ] Deduced a trap composed of 158 places in 309 ms of which 1 ms to minimize.
[2023-03-15 12:11:38] [INFO ] Deduced a trap composed of 159 places in 383 ms of which 1 ms to minimize.
[2023-03-15 12:11:38] [INFO ] Deduced a trap composed of 158 places in 300 ms of which 0 ms to minimize.
[2023-03-15 12:11:39] [INFO ] Deduced a trap composed of 141 places in 386 ms of which 1 ms to minimize.
[2023-03-15 12:11:39] [INFO ] Deduced a trap composed of 28 places in 307 ms of which 0 ms to minimize.
[2023-03-15 12:11:40] [INFO ] Deduced a trap composed of 142 places in 393 ms of which 1 ms to minimize.
[2023-03-15 12:11:40] [INFO ] Deduced a trap composed of 33 places in 373 ms of which 0 ms to minimize.
[2023-03-15 12:11:41] [INFO ] Deduced a trap composed of 144 places in 385 ms of which 0 ms to minimize.
[2023-03-15 12:11:41] [INFO ] Deduced a trap composed of 146 places in 302 ms of which 0 ms to minimize.
[2023-03-15 12:11:41] [INFO ] Deduced a trap composed of 40 places in 370 ms of which 0 ms to minimize.
[2023-03-15 12:11:42] [INFO ] Deduced a trap composed of 39 places in 380 ms of which 1 ms to minimize.
[2023-03-15 12:11:42] [INFO ] Deduced a trap composed of 119 places in 306 ms of which 0 ms to minimize.
[2023-03-15 12:11:43] [INFO ] Deduced a trap composed of 43 places in 304 ms of which 1 ms to minimize.
[2023-03-15 12:11:43] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2023-03-15 12:11:43] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 13215 ms
[2023-03-15 12:11:44] [INFO ] Deduced a trap composed of 131 places in 383 ms of which 1 ms to minimize.
[2023-03-15 12:11:44] [INFO ] Deduced a trap composed of 134 places in 375 ms of which 1 ms to minimize.
[2023-03-15 12:11:45] [INFO ] Deduced a trap composed of 147 places in 294 ms of which 0 ms to minimize.
[2023-03-15 12:11:45] [INFO ] Deduced a trap composed of 141 places in 360 ms of which 1 ms to minimize.
[2023-03-15 12:11:46] [INFO ] Deduced a trap composed of 40 places in 378 ms of which 0 ms to minimize.
[2023-03-15 12:11:46] [INFO ] Deduced a trap composed of 140 places in 358 ms of which 0 ms to minimize.
[2023-03-15 12:11:46] [INFO ] Deduced a trap composed of 150 places in 363 ms of which 1 ms to minimize.
[2023-03-15 12:11:47] [INFO ] Deduced a trap composed of 102 places in 375 ms of which 1 ms to minimize.
[2023-03-15 12:11:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3396 ms
[2023-03-15 12:11:47] [INFO ] Added : 206 causal constraints over 42 iterations in 21002 ms. Result :sat
Minimization took 2189 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 447/447 transitions.
Applied a total of 0 rules in 11 ms. Remains 449 /449 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 449/449 places, 447/447 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 447/447 transitions.
Applied a total of 0 rules in 11 ms. Remains 449 /449 variables (removed 0) and now considering 447/447 (removed 0) transitions.
// Phase 1: matrix 447 rows 449 cols
[2023-03-15 12:12:19] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 12:12:20] [INFO ] Implicit Places using invariants in 726 ms returned []
// Phase 1: matrix 447 rows 449 cols
[2023-03-15 12:12:20] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-15 12:12:20] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:12:51] [INFO ] Performed 396/449 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 12:12:56] [INFO ] Implicit Places using invariants and state equation in 35527 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 36254 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 448/449 places, 447/447 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 448 transition count 445
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 446 transition count 445
Applied a total of 4 rules in 22 ms. Remains 446 /448 variables (removed 2) and now considering 445/447 (removed 2) transitions.
// Phase 1: matrix 445 rows 446 cols
[2023-03-15 12:12:56] [INFO ] Computed 80 place invariants in 54 ms
[2023-03-15 12:12:57] [INFO ] Implicit Places using invariants in 1823 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 203, 210, 224, 229, 257]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1824 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 427/449 places, 445/447 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 427 transition count 435
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 417 transition count 435
Applied a total of 20 rules in 19 ms. Remains 417 /427 variables (removed 10) and now considering 435/445 (removed 10) transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 12:12:57] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 12:12:58] [INFO ] Implicit Places using invariants in 578 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 12:12:58] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 12:12:58] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:13:23] [INFO ] Implicit Places using invariants and state equation in 24996 ms returned []
Implicit Place search using SMT with State Equation took 25575 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 417/449 places, 435/447 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63705 ms. Remains : 417/449 places, 435/447 transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 12:13:23] [INFO ] Invariants computation overflowed in 34 ms
Incomplete random walk after 1000000 steps, including 144140 resets, run finished after 1051 ms. (steps per millisecond=951 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91471 resets, run finished after 734 ms. (steps per millisecond=1362 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 12:13:25] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 12:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:13:25] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2023-03-15 12:13:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:13:26] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2023-03-15 12:13:26] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:13:26] [INFO ] [Nat]Added 84 Read/Feed constraints in 391 ms returned sat
[2023-03-15 12:13:27] [INFO ] Deduced a trap composed of 119 places in 330 ms of which 0 ms to minimize.
[2023-03-15 12:13:27] [INFO ] Deduced a trap composed of 123 places in 249 ms of which 1 ms to minimize.
[2023-03-15 12:13:28] [INFO ] Deduced a trap composed of 119 places in 244 ms of which 1 ms to minimize.
[2023-03-15 12:13:28] [INFO ] Deduced a trap composed of 108 places in 330 ms of which 1 ms to minimize.
[2023-03-15 12:13:28] [INFO ] Deduced a trap composed of 129 places in 327 ms of which 0 ms to minimize.
[2023-03-15 12:13:29] [INFO ] Deduced a trap composed of 122 places in 247 ms of which 1 ms to minimize.
[2023-03-15 12:13:29] [INFO ] Deduced a trap composed of 118 places in 323 ms of which 1 ms to minimize.
[2023-03-15 12:13:30] [INFO ] Deduced a trap composed of 123 places in 321 ms of which 1 ms to minimize.
[2023-03-15 12:13:30] [INFO ] Deduced a trap composed of 121 places in 318 ms of which 0 ms to minimize.
[2023-03-15 12:13:30] [INFO ] Deduced a trap composed of 130 places in 310 ms of which 0 ms to minimize.
[2023-03-15 12:13:31] [INFO ] Deduced a trap composed of 126 places in 308 ms of which 1 ms to minimize.
[2023-03-15 12:13:31] [INFO ] Deduced a trap composed of 124 places in 310 ms of which 0 ms to minimize.
[2023-03-15 12:13:31] [INFO ] Deduced a trap composed of 126 places in 311 ms of which 0 ms to minimize.
[2023-03-15 12:13:32] [INFO ] Deduced a trap composed of 117 places in 243 ms of which 0 ms to minimize.
[2023-03-15 12:13:32] [INFO ] Deduced a trap composed of 118 places in 313 ms of which 1 ms to minimize.
[2023-03-15 12:13:33] [INFO ] Deduced a trap composed of 112 places in 320 ms of which 1 ms to minimize.
[2023-03-15 12:13:33] [INFO ] Deduced a trap composed of 117 places in 320 ms of which 0 ms to minimize.
[2023-03-15 12:13:33] [INFO ] Deduced a trap composed of 118 places in 318 ms of which 1 ms to minimize.
[2023-03-15 12:13:34] [INFO ] Deduced a trap composed of 19 places in 317 ms of which 1 ms to minimize.
[2023-03-15 12:13:34] [INFO ] Deduced a trap composed of 116 places in 243 ms of which 0 ms to minimize.
[2023-03-15 12:13:34] [INFO ] Deduced a trap composed of 118 places in 330 ms of which 0 ms to minimize.
[2023-03-15 12:13:35] [INFO ] Deduced a trap composed of 119 places in 324 ms of which 1 ms to minimize.
[2023-03-15 12:13:35] [INFO ] Deduced a trap composed of 129 places in 321 ms of which 1 ms to minimize.
[2023-03-15 12:13:35] [INFO ] Deduced a trap composed of 114 places in 319 ms of which 0 ms to minimize.
[2023-03-15 12:13:36] [INFO ] Deduced a trap composed of 118 places in 241 ms of which 0 ms to minimize.
[2023-03-15 12:13:36] [INFO ] Deduced a trap composed of 113 places in 305 ms of which 1 ms to minimize.
[2023-03-15 12:13:36] [INFO ] Deduced a trap composed of 25 places in 323 ms of which 1 ms to minimize.
[2023-03-15 12:13:37] [INFO ] Deduced a trap composed of 125 places in 239 ms of which 1 ms to minimize.
[2023-03-15 12:13:37] [INFO ] Deduced a trap composed of 123 places in 332 ms of which 1 ms to minimize.
[2023-03-15 12:13:38] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 1 ms to minimize.
[2023-03-15 12:13:38] [INFO ] Deduced a trap composed of 125 places in 317 ms of which 1 ms to minimize.
[2023-03-15 12:13:38] [INFO ] Deduced a trap composed of 22 places in 328 ms of which 1 ms to minimize.
[2023-03-15 12:13:39] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 1 ms to minimize.
[2023-03-15 12:13:39] [INFO ] Deduced a trap composed of 118 places in 321 ms of which 1 ms to minimize.
[2023-03-15 12:13:42] [INFO ] Trap strengthening (SAT) tested/added 34/34 trap constraints in 15779 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 417/417 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 12:14:02] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 12:14:02] [INFO ] Implicit Places using invariants in 568 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 12:14:02] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 12:14:02] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:14:32] [INFO ] Performed 403/417 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 12:14:34] [INFO ] Implicit Places using invariants and state equation in 31601 ms returned []
Implicit Place search using SMT with State Equation took 32170 ms to find 0 implicit places.
[2023-03-15 12:14:34] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 12:14:34] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 12:14:34] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32592 ms. Remains : 417/417 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-12 in 199158 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-13
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:14:34] [INFO ] Invariants computation overflowed in 45 ms
Incomplete random walk after 10000 steps, including 1292 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:14:34] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 12:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:14:34] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-15 12:14:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:14:35] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2023-03-15 12:14:35] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 12:14:35] [INFO ] [Nat]Added 73 Read/Feed constraints in 254 ms returned sat
[2023-03-15 12:14:35] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 37 ms.
[2023-03-15 12:14:38] [INFO ] Added : 73 causal constraints over 15 iterations in 2795 ms. Result :sat
Minimization took 666 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 464 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 462 transition count 456
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 461 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 17 place count 457 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 454 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 454 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 453 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 453 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 37 place count 447 transition count 445
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 43 place count 447 transition count 445
Applied a total of 43 rules in 74 ms. Remains 447 /466 variables (removed 19) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 447/466 places, 445/461 transitions.
// Phase 1: matrix 445 rows 447 cols
[2023-03-15 12:14:39] [INFO ] Computed 81 place invariants in 61 ms
Incomplete random walk after 1000000 steps, including 128342 resets, run finished after 1129 ms. (steps per millisecond=885 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84790 resets, run finished after 824 ms. (steps per millisecond=1213 ) properties (out of 1) seen :0
[2023-03-15 12:14:41] [INFO ] Invariant cache hit.
[2023-03-15 12:14:41] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 12:14:41] [INFO ] [Real]Absence check using 2 positive and 79 generalized place invariants in 33 ms returned sat
[2023-03-15 12:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:14:41] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2023-03-15 12:14:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:14:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-15 12:14:41] [INFO ] [Nat]Absence check using 2 positive and 79 generalized place invariants in 34 ms returned sat
[2023-03-15 12:14:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:14:42] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2023-03-15 12:14:42] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:14:42] [INFO ] [Nat]Added 84 Read/Feed constraints in 121 ms returned sat
[2023-03-15 12:14:42] [INFO ] Computed and/alt/rep : 342/2226/342 causal constraints (skipped 102 transitions) in 36 ms.
[2023-03-15 12:14:43] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 0 ms to minimize.
[2023-03-15 12:14:43] [INFO ] Deduced a trap composed of 15 places in 359 ms of which 1 ms to minimize.
[2023-03-15 12:14:44] [INFO ] Deduced a trap composed of 15 places in 351 ms of which 1 ms to minimize.
[2023-03-15 12:14:44] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 1 ms to minimize.
[2023-03-15 12:14:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1566 ms
[2023-03-15 12:14:44] [INFO ] Added : 77 causal constraints over 16 iterations in 2517 ms. Result :sat
Minimization took 959 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 447 /447 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 447/447 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 447 /447 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2023-03-15 12:14:45] [INFO ] Invariant cache hit.
[2023-03-15 12:14:47] [INFO ] Implicit Places using invariants in 1951 ms returned [45, 51, 71, 76, 97, 102, 122, 128, 149, 154, 155, 175, 180, 201, 206, 213, 227, 232, 260]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1952 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 428/447 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 428 transition count 435
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 418 transition count 435
Applied a total of 20 rules in 19 ms. Remains 418 /428 variables (removed 10) and now considering 435/445 (removed 10) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-15 12:14:47] [INFO ] Invariants computation overflowed in 26 ms
[2023-03-15 12:14:48] [INFO ] Implicit Places using invariants in 557 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-15 12:14:48] [INFO ] Invariants computation overflowed in 26 ms
[2023-03-15 12:14:48] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:15:16] [INFO ] Implicit Places using invariants and state equation in 28139 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 28697 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 417/447 places, 435/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 417 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 415 transition count 433
Applied a total of 4 rules in 19 ms. Remains 415 /417 variables (removed 2) and now considering 433/435 (removed 2) transitions.
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 12:15:16] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 12:15:17] [INFO ] Implicit Places using invariants in 564 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 12:15:17] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 12:15:17] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:15:47] [INFO ] Performed 371/415 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 12:15:51] [INFO ] Implicit Places using invariants and state equation in 34204 ms returned []
Implicit Place search using SMT with State Equation took 34769 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 415/447 places, 433/445 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 65467 ms. Remains : 415/447 places, 433/445 transitions.
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 12:15:51] [INFO ] Invariants computation overflowed in 37 ms
Incomplete random walk after 1000000 steps, including 144348 resets, run finished after 1055 ms. (steps per millisecond=947 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91410 resets, run finished after 741 ms. (steps per millisecond=1349 ) properties (out of 1) seen :0
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 12:15:53] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 12:15:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:15:53] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2023-03-15 12:15:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:15:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:15:54] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2023-03-15 12:15:54] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:15:55] [INFO ] [Nat]Added 84 Read/Feed constraints in 624 ms returned sat
[2023-03-15 12:15:55] [INFO ] Computed and/alt/rep : 323/2160/323 causal constraints (skipped 109 transitions) in 33 ms.
[2023-03-15 12:15:57] [INFO ] Deduced a trap composed of 8 places in 289 ms of which 1 ms to minimize.
[2023-03-15 12:15:58] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 0 ms to minimize.
[2023-03-15 12:15:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 617 ms
[2023-03-15 12:15:58] [INFO ] Added : 90 causal constraints over 18 iterations in 3092 ms. Result :sat
Minimization took 382 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 REACHABILITY mode, iteration 0 : 415/415 places, 433/433 transitions.
Applied a total of 0 rules in 9 ms. Remains 415 /415 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 415/415 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 415 /415 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 12:15:58] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 12:15:59] [INFO ] Implicit Places using invariants in 572 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 12:15:59] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 12:15:59] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:16:10] [INFO ] Implicit Places using invariants and state equation in 11607 ms returned []
Implicit Place search using SMT with State Equation took 12181 ms to find 0 implicit places.
[2023-03-15 12:16:10] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 12:16:10] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 12:16:11] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12595 ms. Remains : 415/415 places, 433/433 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-13 in 96671 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-14
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:16:11] [INFO ] Invariants computation overflowed in 44 ms
Incomplete random walk after 10000 steps, including 1296 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 841 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:16:11] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 12:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:16:11] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2023-03-15 12:16:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:16:11] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2023-03-15 12:16:11] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 12:16:13] [INFO ] [Nat]Added 73 Read/Feed constraints in 1424 ms returned sat
[2023-03-15 12:16:13] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 36 ms.
[2023-03-15 12:16:14] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 1 ms to minimize.
[2023-03-15 12:16:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2023-03-15 12:16:14] [INFO ] Added : 58 causal constraints over 12 iterations in 895 ms. Result :sat
Minimization took 511 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Graph (complete) has 3535 edges and 466 vertex of which 464 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 464 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 462 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 462 transition count 456
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 461 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 15 place count 458 transition count 453
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 456 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 456 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 455 transition count 452
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 455 transition count 446
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 33 place count 449 transition count 446
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 39 place count 449 transition count 446
Applied a total of 39 rules in 66 ms. Remains 449 /466 variables (removed 17) and now considering 446/461 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 449/466 places, 446/461 transitions.
// Phase 1: matrix 446 rows 449 cols
[2023-03-15 12:16:15] [INFO ] Computed 81 place invariants in 57 ms
Incomplete random walk after 1000000 steps, including 128254 resets, run finished after 1122 ms. (steps per millisecond=891 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85001 resets, run finished after 809 ms. (steps per millisecond=1236 ) properties (out of 1) seen :0
[2023-03-15 12:16:16] [INFO ] Invariant cache hit.
[2023-03-15 12:16:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-15 12:16:17] [INFO ] [Real]Absence check using 3 positive and 78 generalized place invariants in 44 ms returned sat
[2023-03-15 12:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:16:17] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2023-03-15 12:16:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:16:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-15 12:16:17] [INFO ] [Nat]Absence check using 3 positive and 78 generalized place invariants in 41 ms returned sat
[2023-03-15 12:16:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:16:17] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2023-03-15 12:16:17] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-15 12:16:17] [INFO ] [Nat]Added 82 Read/Feed constraints in 134 ms returned sat
[2023-03-15 12:16:18] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 1 ms to minimize.
[2023-03-15 12:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2023-03-15 12:16:18] [INFO ] Computed and/alt/rep : 346/2214/346 causal constraints (skipped 99 transitions) in 35 ms.
[2023-03-15 12:16:26] [INFO ] Added : 65 causal constraints over 13 iterations in 8096 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 446/446 transitions.
Applied a total of 0 rules in 11 ms. Remains 449 /449 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 449/449 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 446/446 transitions.
Applied a total of 0 rules in 11 ms. Remains 449 /449 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-15 12:16:26] [INFO ] Invariant cache hit.
[2023-03-15 12:16:28] [INFO ] Implicit Places using invariants in 2050 ms returned [45, 51, 73, 78, 99, 104, 124, 130, 151, 156, 157, 177, 182, 203, 208, 215, 229, 234, 262]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 2051 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 430/449 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 430 transition count 436
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 420 transition count 436
Applied a total of 20 rules in 28 ms. Remains 420 /430 variables (removed 10) and now considering 436/446 (removed 10) transitions.
// Phase 1: matrix 436 rows 420 cols
[2023-03-15 12:16:28] [INFO ] Invariants computation overflowed in 97 ms
[2023-03-15 12:16:29] [INFO ] Implicit Places using invariants in 668 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2023-03-15 12:16:29] [INFO ] Invariants computation overflowed in 97 ms
[2023-03-15 12:16:29] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-15 12:16:59] [INFO ] Performed 413/420 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 12:17:00] [INFO ] Implicit Places using invariants and state equation in 31048 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31718 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/449 places, 436/446 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 434
Applied a total of 4 rules in 19 ms. Remains 417 /419 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 12:17:00] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 12:17:00] [INFO ] Implicit Places using invariants in 566 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 12:17:00] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 12:17:01] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-15 12:17:31] [INFO ] Performed 406/417 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 12:17:31] [INFO ] Implicit Places using invariants and state equation in 30961 ms returned []
Implicit Place search using SMT with State Equation took 31527 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 417/449 places, 434/446 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 65354 ms. Remains : 417/449 places, 434/446 transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 12:17:31] [INFO ] Invariants computation overflowed in 33 ms
Incomplete random walk after 1000000 steps, including 144463 resets, run finished after 1054 ms. (steps per millisecond=948 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91524 resets, run finished after 739 ms. (steps per millisecond=1353 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 12:17:33] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 12:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:17:33] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2023-03-15 12:17:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:17:34] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2023-03-15 12:17:34] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-15 12:17:34] [INFO ] [Nat]Added 82 Read/Feed constraints in 75 ms returned sat
[2023-03-15 12:17:34] [INFO ] Computed and/alt/rep : 331/2191/331 causal constraints (skipped 102 transitions) in 32 ms.
[2023-03-15 12:17:35] [INFO ] Added : 70 causal constraints over 14 iterations in 1236 ms. Result :sat
Minimization took 606 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 417/417 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 12:17:36] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 12:17:37] [INFO ] Implicit Places using invariants in 444 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 12:17:37] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 12:17:37] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-15 12:18:07] [INFO ] Performed 394/417 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 12:18:08] [INFO ] Implicit Places using invariants and state equation in 31842 ms returned []
Implicit Place search using SMT with State Equation took 32291 ms to find 0 implicit places.
[2023-03-15 12:18:08] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 12:18:08] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 12:18:09] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32695 ms. Remains : 417/417 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-14 in 118052 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-15
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:18:09] [INFO ] Invariants computation overflowed in 45 ms
Incomplete random walk after 10000 steps, including 1323 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 466 cols
[2023-03-15 12:18:09] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 12:18:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:18:09] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-15 12:18:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:18:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:18:10] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2023-03-15 12:18:10] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 12:18:12] [INFO ] [Nat]Added 73 Read/Feed constraints in 2203 ms returned sat
[2023-03-15 12:18:12] [INFO ] Computed and/alt/rep : 377/2231/377 causal constraints (skipped 83 transitions) in 38 ms.
[2023-03-15 12:18:15] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 1 ms to minimize.
[2023-03-15 12:18:15] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 466 transition count 459
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 464 transition count 459
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 12 place count 460 transition count 455
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 457 transition count 455
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 457 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 456 transition count 454
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 27 place count 456 transition count 447
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 34 place count 449 transition count 447
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 39 place count 449 transition count 447
Applied a total of 39 rules in 62 ms. Remains 449 /466 variables (removed 17) and now considering 447/461 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 449/466 places, 447/461 transitions.
// Phase 1: matrix 447 rows 449 cols
[2023-03-15 12:18:15] [INFO ] Computed 81 place invariants in 56 ms
Incomplete random walk after 1000000 steps, including 128264 resets, run finished after 1120 ms. (steps per millisecond=892 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84659 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties (out of 1) seen :0
[2023-03-15 12:18:17] [INFO ] Invariant cache hit.
[2023-03-15 12:18:17] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 12:18:17] [INFO ] [Real]Absence check using 2 positive and 79 generalized place invariants in 49 ms returned sat
[2023-03-15 12:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:18:17] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2023-03-15 12:18:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:18:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 12:18:17] [INFO ] [Nat]Absence check using 2 positive and 79 generalized place invariants in 48 ms returned sat
[2023-03-15 12:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:18:18] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2023-03-15 12:18:18] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:18:19] [INFO ] [Nat]Added 84 Read/Feed constraints in 682 ms returned sat
[2023-03-15 12:18:19] [INFO ] Computed and/alt/rep : 345/2242/345 causal constraints (skipped 101 transitions) in 38 ms.
[2023-03-15 12:18:24] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 0 ms to minimize.
[2023-03-15 12:18:24] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 0 ms to minimize.
[2023-03-15 12:18:25] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 0 ms to minimize.
[2023-03-15 12:18:25] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 0 ms to minimize.
[2023-03-15 12:18:25] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 0 ms to minimize.
[2023-03-15 12:18:25] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 1 ms to minimize.
[2023-03-15 12:18:25] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 0 ms to minimize.
[2023-03-15 12:18:25] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 0 ms to minimize.
[2023-03-15 12:18:26] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 0 ms to minimize.
[2023-03-15 12:18:26] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 0 ms to minimize.
[2023-03-15 12:18:26] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 0 ms to minimize.
[2023-03-15 12:18:26] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 0 ms to minimize.
[2023-03-15 12:18:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2471 ms
[2023-03-15 12:18:27] [INFO ] Added : 225 causal constraints over 46 iterations in 7904 ms. Result :sat
Minimization took 2613 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 447/447 transitions.
Applied a total of 0 rules in 11 ms. Remains 449 /449 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 449/449 places, 447/447 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 447/447 transitions.
Applied a total of 0 rules in 11 ms. Remains 449 /449 variables (removed 0) and now considering 447/447 (removed 0) transitions.
[2023-03-15 12:18:29] [INFO ] Invariant cache hit.
[2023-03-15 12:18:30] [INFO ] Implicit Places using invariants in 789 ms returned []
[2023-03-15 12:18:30] [INFO ] Invariant cache hit.
[2023-03-15 12:18:30] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:18:49] [INFO ] Implicit Places using invariants and state equation in 18398 ms returned [24, 73, 104, 124, 130, 151, 156, 157, 177, 182, 203, 208, 215, 229, 234, 262]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 19188 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 433/449 places, 447/447 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 433 transition count 440
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 426 transition count 440
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 426 transition count 440
Applied a total of 17 rules in 31 ms. Remains 426 /433 variables (removed 7) and now considering 440/447 (removed 7) transitions.
// Phase 1: matrix 440 rows 426 cols
[2023-03-15 12:18:49] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 12:18:49] [INFO ] Implicit Places using invariants in 607 ms returned []
// Phase 1: matrix 440 rows 426 cols
[2023-03-15 12:18:49] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 12:18:50] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:19:15] [INFO ] Implicit Places using invariants and state equation in 25855 ms returned []
Implicit Place search using SMT with State Equation took 26463 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 426/449 places, 440/447 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 45693 ms. Remains : 426/449 places, 440/447 transitions.
// Phase 1: matrix 440 rows 426 cols
[2023-03-15 12:19:15] [INFO ] Invariants computation overflowed in 36 ms
Incomplete random walk after 1000000 steps, including 144635 resets, run finished after 1040 ms. (steps per millisecond=961 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91446 resets, run finished after 731 ms. (steps per millisecond=1367 ) properties (out of 1) seen :0
// Phase 1: matrix 440 rows 426 cols
[2023-03-15 12:19:17] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 12:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:19:17] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-15 12:19:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:19:18] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2023-03-15 12:19:18] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:19:19] [INFO ] [Nat]Added 84 Read/Feed constraints in 983 ms returned sat
[2023-03-15 12:19:19] [INFO ] Computed and/alt/rep : 327/2159/327 causal constraints (skipped 112 transitions) in 33 ms.
[2023-03-15 12:19:26] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2023-03-15 12:19:27] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 1 ms to minimize.
[2023-03-15 12:19:27] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 1 ms to minimize.
[2023-03-15 12:19:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 717 ms
[2023-03-15 12:19:27] [INFO ] Added : 277 causal constraints over 57 iterations in 8289 ms. Result :sat
Minimization took 2182 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 426 /426 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 426/426 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 426 /426 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 426 cols
[2023-03-15 12:19:29] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 12:19:30] [INFO ] Implicit Places using invariants in 607 ms returned []
// Phase 1: matrix 440 rows 426 cols
[2023-03-15 12:19:30] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 12:19:30] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 12:19:58] [INFO ] Implicit Places using invariants and state equation in 28155 ms returned []
Implicit Place search using SMT with State Equation took 28764 ms to find 0 implicit places.
[2023-03-15 12:19:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 440 rows 426 cols
[2023-03-15 12:19:58] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 12:19:58] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29184 ms. Remains : 426/426 places, 440/440 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-15 in 109706 ms.
[2023-03-15 12:19:59] [INFO ] Flatten gal took : 183 ms
[2023-03-15 12:19:59] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-15 12:19:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 466 places, 461 transitions and 3664 arcs took 6 ms.
Total runtime 3492175 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/4030/ub_0_ --maxsum=/tmp/4030/ub_1_ --maxsum=/tmp/4030/ub_2_ --maxsum=/tmp/4030/ub_3_ --maxsum=/tmp/4030/ub_4_ --maxsum=/tmp/4030/ub_5_ --maxsum=/tmp/4030/ub_6_ --maxsum=/tmp/4030/ub_7_ --maxsum=/tmp/4030/ub_8_ --maxsum=/tmp/4030/ub_9_ --maxsum=/tmp/4030/ub_10_ --maxsum=/tmp/4030/ub_11_ --maxsum=/tmp/4030/ub_12_ --maxsum=/tmp/4030/ub_13_ --maxsum=/tmp/4030/ub_14_ --maxsum=/tmp/4030/ub_15_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15157816 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16096984 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
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="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
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 r137-smll-167819418600485"
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 ;