About the Execution of ITS-Tools for FireWire-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1117.100 | 181712.00 | 247627.00 | 405.00 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r550-tall-171734899000309.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FireWire-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000309
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 168K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-18-UpperBounds-00
FORMULA_NAME FireWire-PT-18-UpperBounds-01
FORMULA_NAME FireWire-PT-18-UpperBounds-02
FORMULA_NAME FireWire-PT-18-UpperBounds-03
FORMULA_NAME FireWire-PT-18-UpperBounds-04
FORMULA_NAME FireWire-PT-18-UpperBounds-05
FORMULA_NAME FireWire-PT-18-UpperBounds-06
FORMULA_NAME FireWire-PT-18-UpperBounds-07
FORMULA_NAME FireWire-PT-18-UpperBounds-08
FORMULA_NAME FireWire-PT-18-UpperBounds-09
FORMULA_NAME FireWire-PT-18-UpperBounds-10
FORMULA_NAME FireWire-PT-18-UpperBounds-11
FORMULA_NAME FireWire-PT-18-UpperBounds-12
FORMULA_NAME FireWire-PT-18-UpperBounds-13
FORMULA_NAME FireWire-PT-18-UpperBounds-14
FORMULA_NAME FireWire-PT-18-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717370388158
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 23:19:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:19:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:19:49] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-02 23:19:49] [INFO ] Transformed 437 places.
[2024-06-02 23:19:49] [INFO ] Transformed 707 transitions.
[2024-06-02 23:19:49] [INFO ] Found NUPN structural information;
[2024-06-02 23:19:49] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 707 rows 437 cols
[2024-06-02 23:19:49] [INFO ] Computed 9 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 31 ms. (312 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120000 steps (60 resets) in 196 ms. (609 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 23:19:49] [INFO ] Invariant cache hit.
[2024-06-02 23:19:50] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2024-06-02 23:19:50] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2024-06-02 23:19:50] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 13 ms to minimize.
[2024-06-02 23:19:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:19:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 29 ms returned sat
[2024-06-02 23:19:50] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2024-06-02 23:19:51] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2024-06-02 23:19:51] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 49 ms.
Maximisation of solution failed !
Minimization took 4 ms.
[2024-06-02 23:19:55] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:19:55] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-06-02 23:19:56] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:19:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:19:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:19:56] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-06-02 23:19:56] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 3 ms to minimize.
[2024-06-02 23:19:56] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 4 ms to minimize.
[2024-06-02 23:19:56] [INFO ] Deduced a trap composed of 64 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:19:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 590 ms
[2024-06-02 23:19:56] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 52 ms.
[2024-06-02 23:20:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-02 23:20:01] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:01] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-06-02 23:20:01] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 41 ms.
[2024-06-02 23:20:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:20:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 23:20:01] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-06-02 23:20:01] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 40 ms.
[2024-06-02 23:20:06] [INFO ] Added : 463 causal constraints over 93 iterations in 4427 ms. Result :sat
Minimization took 335 ms.
[2024-06-02 23:20:06] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:06] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-06-02 23:20:07] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:20:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:20:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:07] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-06-02 23:20:07] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:20:07] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 3 ms to minimize.
[2024-06-02 23:20:07] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:20:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 532 ms
[2024-06-02 23:20:07] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 32 ms.
[2024-06-02 23:20:12] [INFO ] Added : 465 causal constraints over 93 iterations in 4216 ms. Result :unknown
[2024-06-02 23:20:12] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:12] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2024-06-02 23:20:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:20:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:12] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-06-02 23:20:12] [INFO ] Deduced a trap composed of 247 places in 165 ms of which 3 ms to minimize.
[2024-06-02 23:20:13] [INFO ] Deduced a trap composed of 204 places in 154 ms of which 3 ms to minimize.
[2024-06-02 23:20:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 400 ms
[2024-06-02 23:20:13] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 51 ms.
[2024-06-02 23:20:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-02 23:20:17] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 23:20:17] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-06-02 23:20:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:20:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-06-02 23:20:17] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-06-02 23:20:18] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2024-06-02 23:20:18] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:20:18] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:20:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 548 ms
[2024-06-02 23:20:18] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 40 ms.
[2024-06-02 23:20:22] [INFO ] Added : 445 causal constraints over 89 iterations in 4200 ms. Result :unknown
[2024-06-02 23:20:22] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:22] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-06-02 23:20:23] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 3 ms to minimize.
[2024-06-02 23:20:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:20:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:23] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-06-02 23:20:23] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2024-06-02 23:20:23] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 43 ms.
[2024-06-02 23:20:28] [INFO ] Added : 464 causal constraints over 94 iterations in 4566 ms. Result :unknown
[2024-06-02 23:20:28] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:28] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-06-02 23:20:28] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-06-02 23:20:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:20:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 17 ms returned sat
[2024-06-02 23:20:28] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 3 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 718 ms
[2024-06-02 23:20:29] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 37 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-02 23:20:33] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:33] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-06-02 23:20:34] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:20:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:20:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:34] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-06-02 23:20:34] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:20:34] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:20:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 374 ms
[2024-06-02 23:20:34] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 38 ms.
[2024-06-02 23:20:39] [INFO ] Deduced a trap composed of 128 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:20:39] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 122 ms
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-02 23:20:39] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:39] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-06-02 23:20:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:20:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:39] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-06-02 23:20:39] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:20:40] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:20:40] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 3 ms to minimize.
[2024-06-02 23:20:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 567 ms
[2024-06-02 23:20:40] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 41 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-02 23:20:44] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 23:20:44] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-06-02 23:20:44] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 3 ms to minimize.
[2024-06-02 23:20:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:20:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:45] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-06-02 23:20:45] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:20:45] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:20:45] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 2 ms to minimize.
[2024-06-02 23:20:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 536 ms
[2024-06-02 23:20:45] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 34 ms.
[2024-06-02 23:20:49] [INFO ] Added : 442 causal constraints over 89 iterations in 4092 ms. Result :sat
Minimization took 140 ms.
[2024-06-02 23:20:49] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:50] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-06-02 23:20:50] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:20:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:20:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:20:50] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-06-02 23:20:50] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:20:50] [INFO ] Deduced a trap composed of 183 places in 149 ms of which 2 ms to minimize.
[2024-06-02 23:20:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 376 ms
[2024-06-02 23:20:51] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 42 ms.
[2024-06-02 23:20:55] [INFO ] Added : 445 causal constraints over 89 iterations in 4369 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 313 edges and 437 vertex of which 12 / 437 are part of one of the 3 SCC in 4 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1269 edges and 428 vertex of which 418 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 418 transition count 609
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 334 transition count 607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 174 place count 333 transition count 607
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 174 place count 333 transition count 596
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 196 place count 322 transition count 596
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 254 place count 264 transition count 534
Iterating global reduction 3 with 58 rules applied. Total rules applied 312 place count 264 transition count 534
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 314 place count 264 transition count 532
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 314 place count 264 transition count 528
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 322 place count 260 transition count 528
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 337 place count 245 transition count 471
Iterating global reduction 4 with 15 rules applied. Total rules applied 352 place count 245 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 353 place count 245 transition count 470
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 358 place count 240 transition count 461
Iterating global reduction 5 with 5 rules applied. Total rules applied 363 place count 240 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 365 place count 240 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 366 place count 239 transition count 459
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 368 place count 237 transition count 453
Iterating global reduction 7 with 2 rules applied. Total rules applied 370 place count 237 transition count 453
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 372 place count 235 transition count 449
Iterating global reduction 7 with 2 rules applied. Total rules applied 374 place count 235 transition count 449
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 376 place count 233 transition count 443
Iterating global reduction 7 with 2 rules applied. Total rules applied 378 place count 233 transition count 443
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 380 place count 231 transition count 439
Iterating global reduction 7 with 2 rules applied. Total rules applied 382 place count 231 transition count 439
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 384 place count 229 transition count 433
Iterating global reduction 7 with 2 rules applied. Total rules applied 386 place count 229 transition count 433
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 388 place count 227 transition count 429
Iterating global reduction 7 with 2 rules applied. Total rules applied 390 place count 227 transition count 429
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 392 place count 225 transition count 423
Iterating global reduction 7 with 2 rules applied. Total rules applied 394 place count 225 transition count 423
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 396 place count 223 transition count 419
Iterating global reduction 7 with 2 rules applied. Total rules applied 398 place count 223 transition count 419
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 400 place count 221 transition count 413
Iterating global reduction 7 with 2 rules applied. Total rules applied 402 place count 221 transition count 413
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 404 place count 219 transition count 409
Iterating global reduction 7 with 2 rules applied. Total rules applied 406 place count 219 transition count 409
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 408 place count 217 transition count 405
Iterating global reduction 7 with 2 rules applied. Total rules applied 410 place count 217 transition count 405
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 412 place count 215 transition count 401
Iterating global reduction 7 with 2 rules applied. Total rules applied 414 place count 215 transition count 401
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 484 place count 180 transition count 366
Performed 29 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 7 with 58 rules applied. Total rules applied 542 place count 151 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 544 place count 151 transition count 460
Free-agglomeration rule applied 19 times.
Iterating global reduction 7 with 19 rules applied. Total rules applied 563 place count 151 transition count 441
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 587 place count 132 transition count 436
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 591 place count 128 transition count 432
Iterating global reduction 8 with 4 rules applied. Total rules applied 595 place count 128 transition count 432
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 603 place count 128 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 620 place count 128 transition count 407
Applied a total of 620 rules in 272 ms. Remains 128 /437 variables (removed 309) and now considering 407/707 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 128/437 places, 407/707 transitions.
[2024-06-02 23:20:57] [INFO ] Flow matrix only has 397 transitions (discarded 10 similar events)
// Phase 1: matrix 397 rows 128 cols
[2024-06-02 23:20:57] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (45649 resets) in 1673 ms. (597 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (43456 resets) in 2025 ms. (1974 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-02 23:21:00] [INFO ] Flow matrix only has 397 transitions (discarded 10 similar events)
[2024-06-02 23:21:00] [INFO ] Invariant cache hit.
[2024-06-02 23:21:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:00] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-02 23:21:00] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-02 23:21:00] [INFO ] [Real]Added 64 Read/Feed constraints in 24 ms returned sat
[2024-06-02 23:21:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:00] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-02 23:21:00] [INFO ] [Nat]Added 64 Read/Feed constraints in 20 ms returned sat
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:21:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-06-02 23:21:01] [INFO ] Computed and/alt/rep : 143/784/143 causal constraints (skipped 250 transitions) in 26 ms.
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:21:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2024-06-02 23:21:01] [INFO ] Added : 30 causal constraints over 8 iterations in 365 ms. Result :sat
Minimization took 106 ms.
[2024-06-02 23:21:01] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:01] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-06-02 23:21:01] [INFO ] [Real]Added 64 Read/Feed constraints in 16 ms returned sat
[2024-06-02 23:21:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:01] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-02 23:21:01] [INFO ] [Nat]Added 64 Read/Feed constraints in 25 ms returned sat
[2024-06-02 23:21:01] [INFO ] Computed and/alt/rep : 143/784/143 causal constraints (skipped 250 transitions) in 28 ms.
[2024-06-02 23:21:02] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:21:02] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:21:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2024-06-02 23:21:02] [INFO ] Added : 39 causal constraints over 8 iterations in 412 ms. Result :sat
Minimization took 121 ms.
[2024-06-02 23:21:02] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:02] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-02 23:21:02] [INFO ] [Real]Added 64 Read/Feed constraints in 20 ms returned sat
[2024-06-02 23:21:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:02] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 23:21:02] [INFO ] [Nat]Added 64 Read/Feed constraints in 23 ms returned sat
[2024-06-02 23:21:02] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:21:02] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:21:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2024-06-02 23:21:02] [INFO ] Computed and/alt/rep : 143/784/143 causal constraints (skipped 250 transitions) in 26 ms.
[2024-06-02 23:21:03] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-06-02 23:21:03] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:21:03] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:21:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 276 ms
[2024-06-02 23:21:03] [INFO ] Added : 41 causal constraints over 11 iterations in 610 ms. Result :sat
Minimization took 122 ms.
[2024-06-02 23:21:03] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:03] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-02 23:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:03] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-02 23:21:03] [INFO ] [Nat]Added 64 Read/Feed constraints in 18 ms returned sat
[2024-06-02 23:21:03] [INFO ] Computed and/alt/rep : 143/784/143 causal constraints (skipped 250 transitions) in 40 ms.
[2024-06-02 23:21:04] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2024-06-02 23:21:04] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:21:04] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:21:04] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:21:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 438 ms
[2024-06-02 23:21:04] [INFO ] Added : 23 causal constraints over 7 iterations in 659 ms. Result :sat
Minimization took 156 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 407/407 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 406
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 128 transition count 405
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 127 transition count 405
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 125 transition count 403
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 125 transition count 403
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 123 transition count 401
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 123 transition count 396
Drop transitions (Redundant composition of simpler transitions.) removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 2 with 76 rules applied. Total rules applied 92 place count 123 transition count 320
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 123 transition count 319
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 97 place count 122 transition count 316
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 122 transition count 316
Applied a total of 99 rules in 35 ms. Remains 122 /128 variables (removed 6) and now considering 316/407 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 122/128 places, 316/407 transitions.
[2024-06-02 23:21:04] [INFO ] Flow matrix only has 284 transitions (discarded 32 similar events)
// Phase 1: matrix 284 rows 122 cols
[2024-06-02 23:21:04] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (51305 resets) in 1265 ms. (789 steps per ms)
BEST_FIRST walk for 4000003 steps (51347 resets) in 1735 ms. (2304 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 23:21:07] [INFO ] Flow matrix only has 284 transitions (discarded 32 similar events)
[2024-06-02 23:21:07] [INFO ] Invariant cache hit.
[2024-06-02 23:21:07] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:07] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 23:21:07] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-02 23:21:07] [INFO ] [Real]Added 64 Read/Feed constraints in 20 ms returned sat
[2024-06-02 23:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:08] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-02 23:21:08] [INFO ] [Nat]Added 64 Read/Feed constraints in 25 ms returned sat
[2024-06-02 23:21:08] [INFO ] Computed and/alt/rep : 129/747/129 causal constraints (skipped 151 transitions) in 15 ms.
[2024-06-02 23:21:08] [INFO ] Added : 43 causal constraints over 9 iterations in 207 ms. Result :sat
Minimization took 106 ms.
[2024-06-02 23:21:08] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:08] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 23:21:08] [INFO ] [Real]Added 64 Read/Feed constraints in 19 ms returned sat
[2024-06-02 23:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:08] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 23:21:08] [INFO ] [Nat]Added 64 Read/Feed constraints in 22 ms returned sat
[2024-06-02 23:21:08] [INFO ] Computed and/alt/rep : 129/747/129 causal constraints (skipped 151 transitions) in 16 ms.
[2024-06-02 23:21:08] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-02 23:21:08] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:21:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2024-06-02 23:21:09] [INFO ] Added : 25 causal constraints over 7 iterations in 312 ms. Result :sat
Minimization took 99 ms.
[2024-06-02 23:21:09] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:09] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 23:21:09] [INFO ] [Real]Added 64 Read/Feed constraints in 19 ms returned sat
[2024-06-02 23:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:09] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 23:21:09] [INFO ] [Nat]Added 64 Read/Feed constraints in 22 ms returned sat
[2024-06-02 23:21:09] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:21:09] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:21:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2024-06-02 23:21:09] [INFO ] Computed and/alt/rep : 129/747/129 causal constraints (skipped 151 transitions) in 16 ms.
[2024-06-02 23:21:09] [INFO ] Added : 53 causal constraints over 11 iterations in 243 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 316/316 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 120 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 120 transition count 312
Applied a total of 4 rules in 9 ms. Remains 120 /122 variables (removed 2) and now considering 312/316 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 120/122 places, 312/316 transitions.
[2024-06-02 23:21:09] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
// Phase 1: matrix 280 rows 120 cols
[2024-06-02 23:21:09] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (51284 resets) in 1193 ms. (837 steps per ms)
BEST_FIRST walk for 3000003 steps (38642 resets) in 1291 ms. (2321 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 23:21:12] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
[2024-06-02 23:21:12] [INFO ] Invariant cache hit.
[2024-06-02 23:21:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:12] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-02 23:21:12] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 23:21:12] [INFO ] [Real]Added 63 Read/Feed constraints in 15 ms returned sat
[2024-06-02 23:21:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:12] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 23:21:12] [INFO ] [Nat]Added 63 Read/Feed constraints in 16 ms returned sat
[2024-06-02 23:21:12] [INFO ] Computed and/alt/rep : 126/742/126 causal constraints (skipped 150 transitions) in 17 ms.
[2024-06-02 23:21:12] [INFO ] Added : 51 causal constraints over 12 iterations in 254 ms. Result :sat
Minimization took 112 ms.
[2024-06-02 23:21:13] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:13] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-02 23:21:13] [INFO ] [Real]Added 63 Read/Feed constraints in 23 ms returned sat
[2024-06-02 23:21:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:13] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 23:21:13] [INFO ] [Nat]Added 63 Read/Feed constraints in 20 ms returned sat
[2024-06-02 23:21:13] [INFO ] Computed and/alt/rep : 126/742/126 causal constraints (skipped 150 transitions) in 17 ms.
[2024-06-02 23:21:13] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:21:13] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:21:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2024-06-02 23:21:13] [INFO ] Added : 34 causal constraints over 9 iterations in 409 ms. Result :sat
Minimization took 105 ms.
[2024-06-02 23:21:13] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:13] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 23:21:13] [INFO ] [Real]Added 63 Read/Feed constraints in 21 ms returned sat
[2024-06-02 23:21:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:14] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-02 23:21:14] [INFO ] [Nat]Added 63 Read/Feed constraints in 17 ms returned sat
[2024-06-02 23:21:14] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 14 ms to minimize.
[2024-06-02 23:21:14] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:21:14] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:21:14] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:21:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 302 ms
[2024-06-02 23:21:14] [INFO ] Computed and/alt/rep : 126/742/126 causal constraints (skipped 150 transitions) in 16 ms.
[2024-06-02 23:21:14] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:21:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-06-02 23:21:14] [INFO ] Added : 43 causal constraints over 16 iterations in 423 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 312/312 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 120/120 places, 312/312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 312/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 120 /120 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-02 23:21:14] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
[2024-06-02 23:21:14] [INFO ] Invariant cache hit.
[2024-06-02 23:21:15] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-06-02 23:21:15] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
[2024-06-02 23:21:15] [INFO ] Invariant cache hit.
[2024-06-02 23:21:15] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 23:21:15] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2024-06-02 23:21:15] [INFO ] Redundant transitions in 16 ms returned []
Running 308 sub problems to find dead transitions.
[2024-06-02 23:21:15] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
[2024-06-02 23:21:15] [INFO ] Invariant cache hit.
[2024-06-02 23:21:15] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 23:21:17] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-06-02 23:21:17] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:21:17] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:21:17] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-02 23:21:18] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 280/400 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 195 constraints, problems are : Problem set: 0 solved, 308 unsolved in 9300 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 280/400 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 308/503 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 23:21:37] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/400 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/400 variables, and 504 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 6/6 constraints]
After SMT, in 39583ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 39598ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40239 ms. Remains : 120/120 places, 312/312 transitions.
RANDOM walk for 40000 steps (2065 resets) in 973 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (510 resets) in 396 ms. (100 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (514 resets) in 235 ms. (169 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (525 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (511 resets) in 165 ms. (240 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (522 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (525 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
[2024-06-02 23:21:56] [INFO ] Flatten gal took : 109 ms
[2024-06-02 23:21:56] [INFO ] Flatten gal took : 49 ms
[2024-06-02 23:21:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16771771780600629262.gal : 46 ms
[2024-06-02 23:21:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6245302300362314054.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16771771780600629262.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6245302300362314054.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6245302300362314054.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :7 after 9
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :11 after 47
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :47 after 51
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :51 after 91
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :91 after 171
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :171 after 305
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :305 after 1249
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1249 after 2377
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2377 after 6881
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :6881 after 12013
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :12013 after 59313
Interrupted probabilistic random walk after 604790 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :2 out of 6
Probabilistic random walk after 604790 steps, saw 164007 distinct states, run finished after 3017 ms. (steps per millisecond=200 ) properties seen :2
[2024-06-02 23:21:59] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
[2024-06-02 23:21:59] [INFO ] Invariant cache hit.
[2024-06-02 23:21:59] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 69/112 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:21:59] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :59313 after 97639
At refinement iteration 6 (OVERLAPS) 280/392 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 63/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/400 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/400 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 191 constraints, problems are : Problem set: 0 solved, 4 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 69/112 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:21:59] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:21:59] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 280/392 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 63/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 8/400 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:22:00] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:22:00] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/400 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 199 constraints, problems are : Problem set: 0 solved, 4 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 1279ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 242 ms.
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 312/312 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 119 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 118 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 118 transition count 309
Applied a total of 4 rules in 8 ms. Remains 118 /120 variables (removed 2) and now considering 309/312 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 118/120 places, 309/312 transitions.
RANDOM walk for 40000 steps (2064 resets) in 245 ms. (162 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (511 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (507 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (523 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (518 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :97639 after 841270
Interrupted probabilistic random walk after 583042 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 4
Probabilistic random walk after 583042 steps, saw 158982 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2024-06-02 23:22:03] [INFO ] Flow matrix only has 277 transitions (discarded 32 similar events)
// Phase 1: matrix 277 rows 118 cols
[2024-06-02 23:22:03] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:22:03] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 67/110 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 277/387 variables, 110/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 63/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 8/395 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/395 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 188 constraints, problems are : Problem set: 0 solved, 4 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 67/110 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:22:05] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:22:05] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 277/387 variables, 110/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 63/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 8/395 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/395 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 194 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 3250ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 118 ms.
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 309/309 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 118/118 places, 309/309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 309/309 transitions.
Applied a total of 0 rules in 16 ms. Remains 118 /118 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2024-06-02 23:22:07] [INFO ] Flow matrix only has 277 transitions (discarded 32 similar events)
[2024-06-02 23:22:07] [INFO ] Invariant cache hit.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :841270 after 8.9561e+06
[2024-06-02 23:22:10] [INFO ] Implicit Places using invariants in 2950 ms returned []
[2024-06-02 23:22:10] [INFO ] Flow matrix only has 277 transitions (discarded 32 similar events)
[2024-06-02 23:22:10] [INFO ] Invariant cache hit.
[2024-06-02 23:22:10] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 23:22:10] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 3193 ms to find 0 implicit places.
[2024-06-02 23:22:10] [INFO ] Redundant transitions in 13 ms returned []
Running 305 sub problems to find dead transitions.
[2024-06-02 23:22:10] [INFO ] Flow matrix only has 277 transitions (discarded 32 similar events)
[2024-06-02 23:22:10] [INFO ] Invariant cache hit.
[2024-06-02 23:22:10] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 23:22:12] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2024-06-02 23:22:12] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:22:12] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:22:12] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:22:13] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:22:13] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-02 23:22:13] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.04006e+07,17.1602,391432,2,14345,23,988366,8,0,796,1.44848e+06,0
Total reachable state count : 30400562
Verifying 6 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,3056,17.1622,391432,2,1650,23,988366,9,0,799,1.44848e+06,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,3056,17.1632,391432,2,1650,23,988366,10,0,800,1.44848e+06,0
Reachability property MAX1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,6,17.1636,391432,2,126,23,988366,11,0,802,1.44848e+06,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,6,17.164,391432,2,126,23,988366,12,0,803,1.44848e+06,0
Reachability property MAX2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,6.0216e+06,17.1663,391432,2,6786,23,988366,12,0,804,1.44848e+06,0
Invariant property MIN2 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,6.0216e+06,17.1685,391432,2,6786,23,988366,12,0,804,1.44848e+06,0
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 277/395 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 0/395 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 195 constraints, problems are : Problem set: 0 solved, 305 unsolved in 8880 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 277/395 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 305/500 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 23:22:27] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 501 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 8/8 constraints]
After SMT, in 39255ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 39259ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42496 ms. Remains : 118/118 places, 309/309 transitions.
FORMULA FireWire-PT-18-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-18-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-18-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 180434 ms.
BK_STOP 1717370569870
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-18, 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 r550-tall-171734899000309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-18.tgz
mv FireWire-PT-18 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 ;