About the Execution of 2023-gold for FunctionPointer-PT-c032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14978.728 | 3600000.00 | 11807411.00 | 6293.40 | TTF?FTFFFFTTTTFF | 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.r197-tall-171640625100193.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 gold2023
Input is FunctionPointer-PT-c032, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625100193
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716536064887
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c032
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 07:34:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 07:34:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 07:34:26] [INFO ] Load time of PNML (sax parser for PT used): 333 ms
[2024-05-24 07:34:26] [INFO ] Transformed 2826 places.
[2024-05-24 07:34:26] [INFO ] Transformed 8960 transitions.
[2024-05-24 07:34:26] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 438 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1198 places in 30 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c032-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 294 places :
Symmetric choice reduction at 1 with 294 rule applications. Total rules 311 place count 1317 transition count 3762
Iterating global reduction 1 with 294 rules applied. Total rules applied 605 place count 1317 transition count 3762
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 408 transitions.
Iterating post reduction 1 with 408 rules applied. Total rules applied 1013 place count 1317 transition count 3354
Discarding 150 places :
Symmetric choice reduction at 2 with 150 rule applications. Total rules 1163 place count 1167 transition count 3054
Iterating global reduction 2 with 150 rules applied. Total rules applied 1313 place count 1167 transition count 3054
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 1401 place count 1167 transition count 2966
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1415 place count 1153 transition count 2938
Iterating global reduction 3 with 14 rules applied. Total rules applied 1429 place count 1153 transition count 2938
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1443 place count 1139 transition count 2910
Iterating global reduction 3 with 14 rules applied. Total rules applied 1457 place count 1139 transition count 2910
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1471 place count 1125 transition count 2882
Iterating global reduction 3 with 14 rules applied. Total rules applied 1485 place count 1125 transition count 2882
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1498 place count 1112 transition count 2856
Iterating global reduction 3 with 13 rules applied. Total rules applied 1511 place count 1112 transition count 2856
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1524 place count 1099 transition count 2830
Iterating global reduction 3 with 13 rules applied. Total rules applied 1537 place count 1099 transition count 2830
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1550 place count 1086 transition count 2804
Iterating global reduction 3 with 13 rules applied. Total rules applied 1563 place count 1086 transition count 2804
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1576 place count 1073 transition count 2778
Iterating global reduction 3 with 13 rules applied. Total rules applied 1589 place count 1073 transition count 2778
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 1636 place count 1026 transition count 2604
Iterating global reduction 3 with 47 rules applied. Total rules applied 1683 place count 1026 transition count 2604
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1737 place count 972 transition count 2388
Iterating global reduction 3 with 54 rules applied. Total rules applied 1791 place count 972 transition count 2388
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1845 place count 918 transition count 2252
Iterating global reduction 3 with 54 rules applied. Total rules applied 1899 place count 918 transition count 2252
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1953 place count 864 transition count 2144
Iterating global reduction 3 with 54 rules applied. Total rules applied 2007 place count 864 transition count 2144
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2060 place count 811 transition count 2038
Iterating global reduction 3 with 53 rules applied. Total rules applied 2113 place count 811 transition count 2038
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2166 place count 758 transition count 1932
Iterating global reduction 3 with 53 rules applied. Total rules applied 2219 place count 758 transition count 1932
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2272 place count 705 transition count 1826
Iterating global reduction 3 with 53 rules applied. Total rules applied 2325 place count 705 transition count 1826
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 2338 place count 692 transition count 1800
Iterating global reduction 3 with 13 rules applied. Total rules applied 2351 place count 692 transition count 1800
Applied a total of 2351 rules in 1127 ms. Remains 692 /1628 variables (removed 936) and now considering 1800/5962 (removed 4162) transitions.
[2024-05-24 07:34:28] [INFO ] Flow matrix only has 1206 transitions (discarded 594 similar events)
// Phase 1: matrix 1206 rows 692 cols
[2024-05-24 07:34:28] [INFO ] Computed 2 invariants in 37 ms
[2024-05-24 07:34:28] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-24 07:34:28] [INFO ] Flow matrix only has 1206 transitions (discarded 594 similar events)
[2024-05-24 07:34:28] [INFO ] Invariant cache hit.
[2024-05-24 07:34:29] [INFO ] State equation strengthened by 293 read => feed constraints.
[2024-05-24 07:34:30] [INFO ] Implicit Places using invariants and state equation in 2096 ms returned []
Implicit Place search using SMT with State Equation took 2638 ms to find 0 implicit places.
[2024-05-24 07:34:30] [INFO ] Flow matrix only has 1206 transitions (discarded 594 similar events)
[2024-05-24 07:34:30] [INFO ] Invariant cache hit.
[2024-05-24 07:34:31] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 692/1628 places, 1800/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4310 ms. Remains : 692/1628 places, 1800/5962 transitions.
Support contains 18 out of 692 places after structural reductions.
[2024-05-24 07:34:31] [INFO ] Flatten gal took : 140 ms
[2024-05-24 07:34:31] [INFO ] Flatten gal took : 87 ms
[2024-05-24 07:34:31] [INFO ] Input system was already deterministic with 1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-24 07:34:32] [INFO ] Flow matrix only has 1206 transitions (discarded 594 similar events)
[2024-05-24 07:34:32] [INFO ] Invariant cache hit.
[2024-05-24 07:34:32] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 07:34:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:34:34] [INFO ] After 2463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-24 07:34:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:34:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:34:36] [INFO ] After 1532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-24 07:34:36] [INFO ] State equation strengthened by 293 read => feed constraints.
[2024-05-24 07:34:38] [INFO ] After 1212ms SMT Verify possible using 293 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-24 07:34:38] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 4 ms to minimize.
[2024-05-24 07:34:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-05-24 07:34:39] [INFO ] After 2724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 916 ms.
[2024-05-24 07:34:40] [INFO ] After 5568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 324 ms.
Support contains 16 out of 692 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 692/692 places, 1800/1800 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 691 transition count 1798
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 691 transition count 1798
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 691 transition count 1796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 690 transition count 1794
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 690 transition count 1794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 689 transition count 1792
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 689 transition count 1792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 688 transition count 1790
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 688 transition count 1790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 687 transition count 1788
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 687 transition count 1788
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 686 transition count 1784
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 686 transition count 1784
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 685 transition count 1780
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 685 transition count 1780
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 684 transition count 1778
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 684 transition count 1778
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 683 transition count 1776
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 683 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 682 transition count 1774
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 682 transition count 1774
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 681 transition count 1772
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 681 transition count 1772
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 680 transition count 1770
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 680 transition count 1770
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 44 place count 680 transition count 1752
Applied a total of 44 rules in 565 ms. Remains 680 /692 variables (removed 12) and now considering 1752/1800 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 565 ms. Remains : 680/692 places, 1752/1800 transitions.
Incomplete random walk after 10029 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 172284 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172284 steps, saw 112300 distinct states, run finished after 3003 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 14 properties.
[2024-05-24 07:34:44] [INFO ] Flow matrix only has 1178 transitions (discarded 574 similar events)
// Phase 1: matrix 1178 rows 680 cols
[2024-05-24 07:34:44] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 07:34:45] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:34:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 07:34:46] [INFO ] After 2124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-24 07:34:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:34:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:34:48] [INFO ] After 1446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-24 07:34:48] [INFO ] State equation strengthened by 290 read => feed constraints.
[2024-05-24 07:34:49] [INFO ] After 987ms SMT Verify possible using 290 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-05-24 07:34:51] [INFO ] After 2224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 865 ms.
[2024-05-24 07:34:51] [INFO ] After 4890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 277 ms.
Support contains 15 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 1752/1752 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 679 transition count 1750
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 679 transition count 1750
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 678 transition count 1748
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 678 transition count 1748
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 677 transition count 1746
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 677 transition count 1746
Applied a total of 6 rules in 139 ms. Remains 677 /680 variables (removed 3) and now considering 1746/1752 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 677/680 places, 1746/1752 transitions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 153441 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153441 steps, saw 100070 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 14 properties.
[2024-05-24 07:34:55] [INFO ] Flow matrix only has 1172 transitions (discarded 574 similar events)
// Phase 1: matrix 1172 rows 677 cols
[2024-05-24 07:34:55] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 07:34:55] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:34:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:34:57] [INFO ] After 2140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-24 07:34:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 07:34:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:34:59] [INFO ] After 1449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-24 07:34:59] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-24 07:35:00] [INFO ] After 1112ms SMT Verify possible using 288 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-05-24 07:35:01] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 1 ms to minimize.
[2024-05-24 07:35:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-05-24 07:35:02] [INFO ] After 2501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 881 ms.
[2024-05-24 07:35:03] [INFO ] After 5169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 191 ms.
Support contains 15 out of 677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1746/1746 transitions.
Applied a total of 0 rules in 89 ms. Remains 677 /677 variables (removed 0) and now considering 1746/1746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 677/677 places, 1746/1746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1746/1746 transitions.
Applied a total of 0 rules in 86 ms. Remains 677 /677 variables (removed 0) and now considering 1746/1746 (removed 0) transitions.
[2024-05-24 07:35:03] [INFO ] Flow matrix only has 1172 transitions (discarded 574 similar events)
[2024-05-24 07:35:03] [INFO ] Invariant cache hit.
[2024-05-24 07:35:03] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-24 07:35:03] [INFO ] Flow matrix only has 1172 transitions (discarded 574 similar events)
[2024-05-24 07:35:03] [INFO ] Invariant cache hit.
[2024-05-24 07:35:04] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-24 07:35:06] [INFO ] Implicit Places using invariants and state equation in 2311 ms returned []
Implicit Place search using SMT with State Equation took 2612 ms to find 0 implicit places.
[2024-05-24 07:35:06] [INFO ] Redundant transitions in 100 ms returned []
[2024-05-24 07:35:06] [INFO ] Flow matrix only has 1172 transitions (discarded 574 similar events)
[2024-05-24 07:35:06] [INFO ] Invariant cache hit.
[2024-05-24 07:35:06] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3326 ms. Remains : 677/677 places, 1746/1746 transitions.
Graph (trivial) has 1012 edges and 677 vertex of which 186 / 677 are part of one of the 62 SCC in 4 ms
Free SCC test removed 124 places
Drop transitions removed 310 transitions
Ensure Unique test removed 450 transitions
Reduce isomorphic transitions removed 760 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 553 transition count 973
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 540 transition count 973
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 27 place count 540 transition count 880
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 213 place count 447 transition count 880
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 274 place count 386 transition count 819
Iterating global reduction 2 with 61 rules applied. Total rules applied 335 place count 386 transition count 819
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 2 with 122 rules applied. Total rules applied 457 place count 386 transition count 697
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 721 place count 254 transition count 565
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 784 place count 191 transition count 439
Iterating global reduction 3 with 63 rules applied. Total rules applied 847 place count 191 transition count 439
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 849 place count 191 transition count 437
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 911 place count 129 transition count 313
Iterating global reduction 4 with 62 rules applied. Total rules applied 973 place count 129 transition count 313
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1035 place count 67 transition count 189
Iterating global reduction 4 with 62 rules applied. Total rules applied 1097 place count 67 transition count 189
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1159 place count 67 transition count 127
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 5 with 2 rules applied. Total rules applied 1161 place count 66 transition count 126
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1173 place count 60 transition count 127
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1177 place count 60 transition count 123
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1178 place count 60 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1179 place count 59 transition count 122
Applied a total of 1179 rules in 73 ms. Remains 59 /677 variables (removed 618) and now considering 122/1746 (removed 1624) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 122 rows 59 cols
[2024-05-24 07:35:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 07:35:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 07:35:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 07:35:06] [INFO ] After 89ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:9
[2024-05-24 07:35:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 07:35:06] [INFO ] After 26ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :2 real:12
[2024-05-24 07:35:06] [INFO ] After 46ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:12
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 07:35:06] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:12
[2024-05-24 07:35:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 07:35:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-24 07:35:07] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-24 07:35:07] [INFO ] After 66ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-05-24 07:35:07] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-24 07:35:07] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
FORMULA FunctionPointer-PT-c032-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(F(!p2)&&(!p0 U (p1||G(!p0))))))))'
Support contains 4 out of 692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 692/692 places, 1800/1800 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 682 transition count 1778
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 682 transition count 1778
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 682 transition count 1776
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 673 transition count 1754
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 673 transition count 1754
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 664 transition count 1724
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 664 transition count 1724
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 66 place count 656 transition count 1698
Iterating global reduction 1 with 8 rules applied. Total rules applied 74 place count 656 transition count 1698
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 82 place count 648 transition count 1682
Iterating global reduction 1 with 8 rules applied. Total rules applied 90 place count 648 transition count 1682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 98 place count 640 transition count 1664
Iterating global reduction 1 with 8 rules applied. Total rules applied 106 place count 640 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 114 place count 632 transition count 1646
Iterating global reduction 1 with 8 rules applied. Total rules applied 122 place count 632 transition count 1646
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 129 place count 625 transition count 1632
Iterating global reduction 1 with 7 rules applied. Total rules applied 136 place count 625 transition count 1632
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 142 place count 619 transition count 1620
Iterating global reduction 1 with 6 rules applied. Total rules applied 148 place count 619 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 149 place count 618 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 150 place count 618 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 151 place count 617 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 152 place count 617 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 616 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 616 transition count 1614
Applied a total of 154 rules in 186 ms. Remains 616 /692 variables (removed 76) and now considering 1614/1800 (removed 186) transitions.
[2024-05-24 07:35:07] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2024-05-24 07:35:07] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 07:35:07] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-24 07:35:07] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-24 07:35:07] [INFO ] Invariant cache hit.
[2024-05-24 07:35:08] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-24 07:35:09] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 1978 ms to find 0 implicit places.
[2024-05-24 07:35:09] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-24 07:35:09] [INFO ] Invariant cache hit.
[2024-05-24 07:35:10] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 616/692 places, 1614/1800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2651 ms. Remains : 616/692 places, 1614/1800 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 344 ms :[true, p2, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 p0 (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s523 1) (GEQ s1 1) (GEQ s537 1)), p0:(AND (GEQ s1 1) (GEQ s520 1)), p1:(AND (NOT (AND (GEQ s1 1) (GEQ s523 1))) (NOT (AND (GEQ s1 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 953 ms.
Product exploration explored 100000 steps with 50000 reset in 838 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 23 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c032-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c032-LTLFireability-01 finished in 4880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Support contains 2 out of 692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 692/692 places, 1800/1800 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 681 transition count 1776
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 681 transition count 1776
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 681 transition count 1772
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 671 transition count 1748
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 671 transition count 1748
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 662 transition count 1718
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 662 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 72 place count 654 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 80 place count 654 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 88 place count 646 transition count 1676
Iterating global reduction 1 with 8 rules applied. Total rules applied 96 place count 646 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 638 transition count 1658
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 638 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 120 place count 630 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 128 place count 630 transition count 1640
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 623 transition count 1626
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 623 transition count 1626
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 148 place count 617 transition count 1614
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 614 transition count 1608
Applied a total of 160 rules in 181 ms. Remains 614 /692 variables (removed 78) and now considering 1608/1800 (removed 192) transitions.
[2024-05-24 07:35:12] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 07:35:12] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 07:35:12] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-24 07:35:12] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 07:35:12] [INFO ] Invariant cache hit.
[2024-05-24 07:35:13] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:35:14] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
[2024-05-24 07:35:14] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 07:35:14] [INFO ] Invariant cache hit.
[2024-05-24 07:35:14] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/692 places, 1608/1800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2666 ms. Remains : 614/692 places, 1608/1800 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s535 1)), p1:(OR (LT s0 1) (LT s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 77 reset in 538 ms.
Product exploration explored 100000 steps with 44 reset in 704 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10015 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 351730 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 351730 steps, saw 228306 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 07:35:19] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 07:35:19] [INFO ] Invariant cache hit.
[2024-05-24 07:35:19] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:35:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 07:35:20] [INFO ] After 491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 07:35:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 07:35:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 07:35:20] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 07:35:20] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:35:20] [INFO ] After 203ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 07:35:20] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 1 ms to minimize.
[2024-05-24 07:35:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-05-24 07:35:21] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-05-24 07:35:21] [INFO ] After 1159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 147 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 272810 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272810 steps, saw 177084 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 07:35:24] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 07:35:24] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 07:35:24] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:35:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:35:24] [INFO ] After 484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 07:35:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 07:35:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:35:25] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 07:35:25] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:35:25] [INFO ] After 212ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 07:35:25] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 1 ms to minimize.
[2024-05-24 07:35:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-05-24 07:35:26] [INFO ] After 582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 192 ms.
[2024-05-24 07:35:26] [INFO ] After 1247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 76 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 74 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 07:35:26] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:35:26] [INFO ] Invariant cache hit.
[2024-05-24 07:35:26] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-24 07:35:26] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:35:26] [INFO ] Invariant cache hit.
[2024-05-24 07:35:27] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:35:28] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2024-05-24 07:35:28] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-24 07:35:28] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:35:28] [INFO ] Invariant cache hit.
[2024-05-24 07:35:28] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2618 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 2 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
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 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 32 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-24 07:35:28] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 07:35:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 07:35:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:35:28] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-24 07:35:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 07:35:29] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 07:35:29] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 07:35:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 07:35:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:35:29] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 07:35:29] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 07:35:29] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-24 07:35:29] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 113 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 16 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 07:35:29] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 07:35:29] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 07:35:29] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-24 07:35:29] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 07:35:29] [INFO ] Invariant cache hit.
[2024-05-24 07:35:29] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:35:31] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2024-05-24 07:35:31] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 07:35:31] [INFO ] Invariant cache hit.
[2024-05-24 07:35:31] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2302 ms. Remains : 614/614 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 75 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 346691 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346691 steps, saw 225034 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 07:35:34] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 07:35:34] [INFO ] Invariant cache hit.
[2024-05-24 07:35:34] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:35:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 07:35:35] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 07:35:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:35:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:35:35] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 07:35:35] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:35:36] [INFO ] After 200ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 07:35:36] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 0 ms to minimize.
[2024-05-24 07:35:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-05-24 07:35:36] [INFO ] After 566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 161 ms.
[2024-05-24 07:35:36] [INFO ] After 1201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 148 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 367387 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 367387 steps, saw 238466 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 07:35:39] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 07:35:39] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 07:35:39] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 07:35:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 07:35:40] [INFO ] After 475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 07:35:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:35:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 07:35:40] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 07:35:40] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:35:40] [INFO ] After 209ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 07:35:41] [INFO ] Deduced a trap composed of 135 places in 108 ms of which 0 ms to minimize.
[2024-05-24 07:35:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2024-05-24 07:35:41] [INFO ] After 565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 191 ms.
[2024-05-24 07:35:41] [INFO ] After 1220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 69 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 70 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 07:35:41] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:35:41] [INFO ] Invariant cache hit.
[2024-05-24 07:35:41] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-24 07:35:42] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:35:42] [INFO ] Invariant cache hit.
[2024-05-24 07:35:42] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:35:43] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 1909 ms to find 0 implicit places.
[2024-05-24 07:35:43] [INFO ] Redundant transitions in 96 ms returned []
[2024-05-24 07:35:43] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:35:43] [INFO ] Invariant cache hit.
[2024-05-24 07:35:44] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2565 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
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 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 30 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-24 07:35:44] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 07:35:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 07:35:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:35:44] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-24 07:35:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 07:35:44] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 07:35:44] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 07:35:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 07:35:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:35:44] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 07:35:44] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 07:35:44] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-24 07:35:44] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 88 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 34 reset in 489 ms.
Product exploration explored 100000 steps with 11 reset in 593 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 274 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
[2024-05-24 07:35:46] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 07:35:46] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 07:35:46] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 07:35:46] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/614 places, 1604/1608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 807 ms. Remains : 614/614 places, 1604/1608 transitions.
Built C files in :
/tmp/ltsmin15962283177359783331
[2024-05-24 07:35:46] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15962283177359783331
Running compilation step : cd /tmp/ltsmin15962283177359783331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2811 ms.
Running link step : cd /tmp/ltsmin15962283177359783331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin15962283177359783331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7772970692096185652.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 25 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 07:36:01] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 07:36:01] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 07:36:02] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-24 07:36:02] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 07:36:02] [INFO ] Invariant cache hit.
[2024-05-24 07:36:02] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:36:03] [INFO ] Implicit Places using invariants and state equation in 1540 ms returned []
Implicit Place search using SMT with State Equation took 1877 ms to find 0 implicit places.
[2024-05-24 07:36:03] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 07:36:03] [INFO ] Invariant cache hit.
[2024-05-24 07:36:04] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2370 ms. Remains : 614/614 places, 1608/1608 transitions.
Built C files in :
/tmp/ltsmin16391778835465936252
[2024-05-24 07:36:04] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16391778835465936252
Running compilation step : cd /tmp/ltsmin16391778835465936252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2659 ms.
Running link step : cd /tmp/ltsmin16391778835465936252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16391778835465936252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7189131460157319426.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 07:36:19] [INFO ] Flatten gal took : 65 ms
[2024-05-24 07:36:19] [INFO ] Flatten gal took : 65 ms
[2024-05-24 07:36:19] [INFO ] Time to serialize gal into /tmp/LTL15939048223350320131.gal : 12 ms
[2024-05-24 07:36:19] [INFO ] Time to serialize properties into /tmp/LTL15569060535538548592.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15939048223350320131.gal' '-t' 'CGAL' '-hoa' '/tmp/aut330945080485832694.hoa' '-atoms' '/tmp/LTL15569060535538548592.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15569060535538548592.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut330945080485832694.hoa
Detected timeout of ITS tools.
[2024-05-24 07:36:34] [INFO ] Flatten gal took : 55 ms
[2024-05-24 07:36:34] [INFO ] Flatten gal took : 45 ms
[2024-05-24 07:36:34] [INFO ] Time to serialize gal into /tmp/LTL3574914537297794808.gal : 8 ms
[2024-05-24 07:36:34] [INFO ] Time to serialize properties into /tmp/LTL14135074764009670841.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3574914537297794808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14135074764009670841.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((s0<1)||(l1629<1))")||(X(G("((s0<1)||(l1629<1))"))))))
Formula 0 simplified : F(!"((s0<1)||(l1629<1))" & XF!"((s0<1)||(l1629<1))")
Detected timeout of ITS tools.
[2024-05-24 07:36:49] [INFO ] Flatten gal took : 41 ms
[2024-05-24 07:36:49] [INFO ] Applying decomposition
[2024-05-24 07:36:49] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7520302182379699606.txt' '-o' '/tmp/graph7520302182379699606.bin' '-w' '/tmp/graph7520302182379699606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7520302182379699606.bin' '-l' '-1' '-v' '-w' '/tmp/graph7520302182379699606.weights' '-q' '0' '-e' '0.001'
[2024-05-24 07:36:50] [INFO ] Decomposing Gal with order
[2024-05-24 07:36:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 07:36:50] [INFO ] Removed a total of 2668 redundant transitions.
[2024-05-24 07:36:50] [INFO ] Flatten gal took : 134 ms
[2024-05-24 07:36:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 1098 labels/synchronizations in 83 ms.
[2024-05-24 07:36:50] [INFO ] Time to serialize gal into /tmp/LTL12763842654660572109.gal : 16 ms
[2024-05-24 07:36:50] [INFO ] Time to serialize properties into /tmp/LTL5877294419330560987.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12763842654660572109.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5877294419330560987.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i1.u1.s0<1)||(i27.i0.u152.l1629<1))")||(X(G("((i1.u1.s0<1)||(i27.i0.u152.l1629<1))"))))))
Formula 0 simplified : F(!"((i1.u1.s0<1)||(i27.i0.u152.l1629<1))" & XF!"((i1.u1.s0<1)||(i27.i0.u152.l1629<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2422403251603217915
[2024-05-24 07:37:05] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2422403251603217915
Running compilation step : cd /tmp/ltsmin2422403251603217915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2681 ms.
Running link step : cd /tmp/ltsmin2422403251603217915;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin2422403251603217915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([]((LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c032-LTLFireability-02 finished in 128276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 692 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 692/692 places, 1800/1800 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 681 transition count 1776
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 681 transition count 1776
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 681 transition count 1772
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 671 transition count 1748
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 671 transition count 1748
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 662 transition count 1718
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 662 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 72 place count 654 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 80 place count 654 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 88 place count 646 transition count 1676
Iterating global reduction 1 with 8 rules applied. Total rules applied 96 place count 646 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 638 transition count 1658
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 638 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 120 place count 630 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 128 place count 630 transition count 1640
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 623 transition count 1626
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 623 transition count 1626
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 148 place count 617 transition count 1614
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 614 transition count 1608
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 164 place count 614 transition count 1604
Applied a total of 164 rules in 336 ms. Remains 614 /692 variables (removed 78) and now considering 1604/1800 (removed 196) transitions.
[2024-05-24 07:37:20] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 07:37:20] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 07:37:21] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-24 07:37:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:37:21] [INFO ] Invariant cache hit.
[2024-05-24 07:37:21] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:37:22] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
[2024-05-24 07:37:22] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-24 07:37:22] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:37:22] [INFO ] Invariant cache hit.
[2024-05-24 07:37:23] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/692 places, 1604/1800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2710 ms. Remains : 614/692 places, 1604/1800 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 72 reset in 528 ms.
Product exploration explored 100000 steps with 35 reset in 559 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 551540 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 551540 steps, saw 357983 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 07:37:27] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:37:27] [INFO ] Invariant cache hit.
[2024-05-24 07:37:27] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:37:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 07:37:28] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:37:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-24 07:37:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:37:28] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:37:28] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:37:28] [INFO ] After 142ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 07:37:28] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-24 07:37:28] [INFO ] After 711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Graph (complete) has 2680 edges and 614 vertex of which 422 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.2 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 422 transition count 1220
Applied a total of 385 rules in 55 ms. Remains 422 /614 variables (removed 192) and now considering 1220/1604 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 422/614 places, 1220/1604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642613 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642613 steps, saw 393993 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 07:37:31] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-24 07:37:31] [INFO ] Computed 3 invariants in 8 ms
[2024-05-24 07:37:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 07:37:32] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:37:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 07:37:32] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:37:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 07:37:32] [INFO ] After 136ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 07:37:32] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-24 07:37:32] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-24 07:37:32] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 07:37:32] [INFO ] Invariant cache hit.
[2024-05-24 07:37:33] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-24 07:37:33] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 07:37:33] [INFO ] Invariant cache hit.
[2024-05-24 07:37:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 07:37:34] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2024-05-24 07:37:34] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-24 07:37:34] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 07:37:34] [INFO ] Invariant cache hit.
[2024-05-24 07:37:34] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1577 ms. Remains : 422/422 places, 1220/1220 transitions.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
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 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 23 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-24 07:37:34] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 07:37:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 07:37:34] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 07:37:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 07:37:34] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-24 07:37:34] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 07:37:34] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 81 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 07:37:34] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 07:37:34] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 07:37:35] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-24 07:37:35] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:37:35] [INFO ] Invariant cache hit.
[2024-05-24 07:37:35] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:37:36] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2024-05-24 07:37:36] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-24 07:37:36] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:37:36] [INFO ] Invariant cache hit.
[2024-05-24 07:37:37] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2589 ms. Remains : 614/614 places, 1604/1604 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 540668 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 540668 steps, saw 350927 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 07:37:40] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:37:40] [INFO ] Invariant cache hit.
[2024-05-24 07:37:40] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 07:37:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 07:37:40] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:37:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 07:37:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 07:37:41] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:37:41] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:37:41] [INFO ] After 146ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 07:37:41] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-05-24 07:37:41] [INFO ] After 733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Graph (complete) has 2680 edges and 614 vertex of which 422 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 422 transition count 1220
Applied a total of 385 rules in 45 ms. Remains 422 /614 variables (removed 192) and now considering 1220/1604 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 422/614 places, 1220/1604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645852 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645852 steps, saw 395978 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 07:37:44] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-24 07:37:44] [INFO ] Computed 3 invariants in 4 ms
[2024-05-24 07:37:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 07:37:45] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:37:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 07:37:45] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:37:45] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 07:37:45] [INFO ] After 128ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 07:37:45] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-24 07:37:45] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-24 07:37:45] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 07:37:45] [INFO ] Invariant cache hit.
[2024-05-24 07:37:45] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-24 07:37:45] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 07:37:45] [INFO ] Invariant cache hit.
[2024-05-24 07:37:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 07:37:46] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2024-05-24 07:37:46] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-24 07:37:46] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 07:37:46] [INFO ] Invariant cache hit.
[2024-05-24 07:37:47] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1619 ms. Remains : 422/422 places, 1220/1220 transitions.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
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 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 24 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-24 07:37:47] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 07:37:47] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 07:37:47] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 07:37:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 07:37:47] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-24 07:37:47] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 07:37:47] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 364 reset in 472 ms.
Product exploration explored 100000 steps with 28 reset in 539 ms.
Built C files in :
/tmp/ltsmin12341726144810433912
[2024-05-24 07:37:48] [INFO ] Too many transitions (1604) to apply POR reductions. Disabling POR matrices.
[2024-05-24 07:37:48] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12341726144810433912
Running compilation step : cd /tmp/ltsmin12341726144810433912;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2683 ms.
Running link step : cd /tmp/ltsmin12341726144810433912;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12341726144810433912;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16481392068140129578.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 73 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 07:38:03] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 07:38:03] [INFO ] Computed 2 invariants in 4 ms
[2024-05-24 07:38:04] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-24 07:38:04] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:38:04] [INFO ] Invariant cache hit.
[2024-05-24 07:38:04] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:38:05] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
[2024-05-24 07:38:05] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-24 07:38:05] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:38:05] [INFO ] Invariant cache hit.
[2024-05-24 07:38:06] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2494 ms. Remains : 614/614 places, 1604/1604 transitions.
Built C files in :
/tmp/ltsmin12842383942937412251
[2024-05-24 07:38:06] [INFO ] Too many transitions (1604) to apply POR reductions. Disabling POR matrices.
[2024-05-24 07:38:06] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12842383942937412251
Running compilation step : cd /tmp/ltsmin12842383942937412251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2695 ms.
Running link step : cd /tmp/ltsmin12842383942937412251;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12842383942937412251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14813413606727860326.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 07:38:21] [INFO ] Flatten gal took : 39 ms
[2024-05-24 07:38:21] [INFO ] Flatten gal took : 38 ms
[2024-05-24 07:38:21] [INFO ] Time to serialize gal into /tmp/LTL7849180173850385694.gal : 6 ms
[2024-05-24 07:38:21] [INFO ] Time to serialize properties into /tmp/LTL11631637252008251143.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7849180173850385694.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6534090756814055901.hoa' '-atoms' '/tmp/LTL11631637252008251143.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11631637252008251143.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6534090756814055901.hoa
Detected timeout of ITS tools.
[2024-05-24 07:38:36] [INFO ] Flatten gal took : 36 ms
[2024-05-24 07:38:36] [INFO ] Flatten gal took : 41 ms
[2024-05-24 07:38:36] [INFO ] Time to serialize gal into /tmp/LTL17059745253249704122.gal : 5 ms
[2024-05-24 07:38:36] [INFO ] Time to serialize properties into /tmp/LTL8798553168395074646.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17059745253249704122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8798553168395074646.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l1634<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1634<1))"
Detected timeout of ITS tools.
[2024-05-24 07:38:51] [INFO ] Flatten gal took : 33 ms
[2024-05-24 07:38:51] [INFO ] Applying decomposition
[2024-05-24 07:38:51] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14438937958610253548.txt' '-o' '/tmp/graph14438937958610253548.bin' '-w' '/tmp/graph14438937958610253548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14438937958610253548.bin' '-l' '-1' '-v' '-w' '/tmp/graph14438937958610253548.weights' '-q' '0' '-e' '0.001'
[2024-05-24 07:38:51] [INFO ] Decomposing Gal with order
[2024-05-24 07:38:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 07:38:51] [INFO ] Removed a total of 2658 redundant transitions.
[2024-05-24 07:38:51] [INFO ] Flatten gal took : 68 ms
[2024-05-24 07:38:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 1158 labels/synchronizations in 68 ms.
[2024-05-24 07:38:51] [INFO ] Time to serialize gal into /tmp/LTL1267256093327231164.gal : 8 ms
[2024-05-24 07:38:51] [INFO ] Time to serialize properties into /tmp/LTL14599408285496718083.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1267256093327231164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14599408285496718083.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i3.i0.u1.s1<1)||(i27.i0.u148.l1634<1))"))))
Formula 0 simplified : FG!"((i3.i0.u1.s1<1)||(i27.i0.u148.l1634<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11375792064223466013
[2024-05-24 07:39:06] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11375792064223466013
Running compilation step : cd /tmp/ltsmin11375792064223466013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2661 ms.
Running link step : cd /tmp/ltsmin11375792064223466013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11375792064223466013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c032-LTLFireability-03 finished in 121485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p1||X(G(p1))))&&p0)))'
Support contains 2 out of 692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 692/692 places, 1800/1800 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 681 transition count 1778
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 681 transition count 1778
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 681 transition count 1774
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 671 transition count 1752
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 671 transition count 1752
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 662 transition count 1720
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 662 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 72 place count 654 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 80 place count 654 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 88 place count 646 transition count 1676
Iterating global reduction 1 with 8 rules applied. Total rules applied 96 place count 646 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 638 transition count 1658
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 638 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 120 place count 630 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 128 place count 630 transition count 1640
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 136 place count 622 transition count 1624
Iterating global reduction 1 with 8 rules applied. Total rules applied 144 place count 622 transition count 1624
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 151 place count 615 transition count 1610
Iterating global reduction 1 with 7 rules applied. Total rules applied 158 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 612 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 612 transition count 1604
Applied a total of 164 rules in 172 ms. Remains 612 /692 variables (removed 80) and now considering 1604/1800 (removed 196) transitions.
[2024-05-24 07:39:22] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2024-05-24 07:39:22] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 07:39:22] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-24 07:39:22] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:39:22] [INFO ] Invariant cache hit.
[2024-05-24 07:39:22] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:39:24] [INFO ] Implicit Places using invariants and state equation in 2102 ms returned []
Implicit Place search using SMT with State Equation took 2434 ms to find 0 implicit places.
[2024-05-24 07:39:24] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:39:24] [INFO ] Invariant cache hit.
[2024-05-24 07:39:25] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/692 places, 1604/1800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3078 ms. Remains : 612/692 places, 1604/1800 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 1}, { cond=true, acceptance={1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 1}, { cond=(NOT p1), acceptance={1} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s531 1)), p1:(AND (GEQ s0 1) (GEQ s531 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 186 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLFireability-06 finished in 3277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U G(p1))))'
Support contains 3 out of 692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 692/692 places, 1800/1800 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 682 transition count 1778
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 682 transition count 1778
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 682 transition count 1774
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 673 transition count 1754
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 673 transition count 1754
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 665 transition count 1728
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 665 transition count 1728
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 658 transition count 1704
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 658 transition count 1704
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 79 place count 651 transition count 1690
Iterating global reduction 1 with 7 rules applied. Total rules applied 86 place count 651 transition count 1690
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 93 place count 644 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 100 place count 644 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 107 place count 637 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 114 place count 637 transition count 1658
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 631 transition count 1646
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 631 transition count 1646
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 132 place count 625 transition count 1634
Iterating global reduction 1 with 6 rules applied. Total rules applied 138 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 624 transition count 1632
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 623 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 622 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 622 transition count 1628
Applied a total of 144 rules in 181 ms. Remains 622 /692 variables (removed 70) and now considering 1628/1800 (removed 172) transitions.
[2024-05-24 07:39:25] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2024-05-24 07:39:25] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 07:39:25] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-24 07:39:25] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 07:39:25] [INFO ] Invariant cache hit.
[2024-05-24 07:39:26] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 07:39:27] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 1754 ms to find 0 implicit places.
[2024-05-24 07:39:27] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 07:39:27] [INFO ] Invariant cache hit.
[2024-05-24 07:39:27] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 622/692 places, 1628/1800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2399 ms. Remains : 622/692 places, 1628/1800 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s550 1)), p0:(AND (GEQ s1 1) (GEQ s540 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLFireability-07 finished in 2533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 692/692 places, 1800/1800 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 681 transition count 1776
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 681 transition count 1776
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 681 transition count 1772
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 671 transition count 1748
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 671 transition count 1748
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 662 transition count 1718
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 662 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 72 place count 654 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 80 place count 654 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 88 place count 646 transition count 1676
Iterating global reduction 1 with 8 rules applied. Total rules applied 96 place count 646 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 638 transition count 1658
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 638 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 120 place count 630 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 128 place count 630 transition count 1640
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 623 transition count 1626
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 623 transition count 1626
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 148 place count 617 transition count 1614
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 614 transition count 1608
Applied a total of 160 rules in 183 ms. Remains 614 /692 variables (removed 78) and now considering 1608/1800 (removed 192) transitions.
[2024-05-24 07:39:28] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 07:39:28] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 07:39:28] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-24 07:39:28] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 07:39:28] [INFO ] Invariant cache hit.
[2024-05-24 07:39:29] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:39:30] [INFO ] Implicit Places using invariants and state equation in 1642 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
[2024-05-24 07:39:30] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 07:39:30] [INFO ] Invariant cache hit.
[2024-05-24 07:39:30] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/692 places, 1608/1800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2621 ms. Remains : 614/692 places, 1608/1800 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 490 steps with 0 reset in 8 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLFireability-09 finished in 3268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||G((F(p2)||(F(!p0)&&F(!p3))||p1)))))'
Support contains 5 out of 692 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 692/692 places, 1800/1800 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 683 transition count 1780
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 683 transition count 1780
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 683 transition count 1776
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 674 transition count 1754
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 674 transition count 1754
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 667 transition count 1730
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 667 transition count 1730
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 660 transition count 1708
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 660 transition count 1708
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 653 transition count 1694
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 653 transition count 1694
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 646 transition count 1678
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 646 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 103 place count 639 transition count 1662
Iterating global reduction 1 with 7 rules applied. Total rules applied 110 place count 639 transition count 1662
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 116 place count 633 transition count 1650
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 633 transition count 1650
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 127 place count 628 transition count 1640
Iterating global reduction 1 with 5 rules applied. Total rules applied 132 place count 628 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 627 transition count 1638
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 626 transition count 1636
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 625 transition count 1634
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 625 transition count 1634
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 144 place count 625 transition count 1628
Applied a total of 144 rules in 331 ms. Remains 625 /692 variables (removed 67) and now considering 1628/1800 (removed 172) transitions.
[2024-05-24 07:39:31] [INFO ] Flow matrix only has 1090 transitions (discarded 538 similar events)
// Phase 1: matrix 1090 rows 625 cols
[2024-05-24 07:39:31] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 07:39:31] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-24 07:39:31] [INFO ] Flow matrix only has 1090 transitions (discarded 538 similar events)
[2024-05-24 07:39:31] [INFO ] Invariant cache hit.
[2024-05-24 07:39:32] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-05-24 07:39:33] [INFO ] Implicit Places using invariants and state equation in 1317 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
[2024-05-24 07:39:33] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-24 07:39:33] [INFO ] Flow matrix only has 1090 transitions (discarded 538 similar events)
[2024-05-24 07:39:33] [INFO ] Invariant cache hit.
[2024-05-24 07:39:33] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 625/692 places, 1628/1800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2443 ms. Remains : 625/692 places, 1628/1800 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s347 1)), p0:(AND (GEQ s1 1) (GEQ s528 1)), p2:(AND (GEQ s0 1) (GEQ s543 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 36 reset in 499 ms.
Product exploration explored 100000 steps with 78 reset in 610 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 352720 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 352720 steps, saw 228947 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 07:39:38] [INFO ] Flow matrix only has 1090 transitions (discarded 538 similar events)
[2024-05-24 07:39:38] [INFO ] Invariant cache hit.
[2024-05-24 07:39:38] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:39:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 07:39:38] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-24 07:39:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:39:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:39:38] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-24 07:39:38] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-05-24 07:39:39] [INFO ] After 303ms SMT Verify possible using 270 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-24 07:39:39] [INFO ] After 536ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-24 07:39:39] [INFO ] After 1125ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 625 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 625/625 places, 1628/1628 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 624 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 623 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 623 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 622 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 622 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 621 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 621 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 620 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 620 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 619 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 619 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 618 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 618 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 617 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 617 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 616 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 616 transition count 1608
Applied a total of 18 rules in 195 ms. Remains 616 /625 variables (removed 9) and now considering 1608/1628 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 616/625 places, 1608/1628 transitions.
Finished random walk after 7100 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=645 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c032-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c032-LTLFireability-12 finished in 8623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 692 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 692/692 places, 1800/1800 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 680 transition count 1774
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 680 transition count 1774
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 680 transition count 1770
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 669 transition count 1744
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 669 transition count 1744
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 60 place count 659 transition count 1710
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 659 transition count 1710
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 79 place count 650 transition count 1680
Iterating global reduction 1 with 9 rules applied. Total rules applied 88 place count 650 transition count 1680
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 97 place count 641 transition count 1662
Iterating global reduction 1 with 9 rules applied. Total rules applied 106 place count 641 transition count 1662
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 115 place count 632 transition count 1642
Iterating global reduction 1 with 9 rules applied. Total rules applied 124 place count 632 transition count 1642
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 133 place count 623 transition count 1622
Iterating global reduction 1 with 9 rules applied. Total rules applied 142 place count 623 transition count 1622
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 150 place count 615 transition count 1606
Iterating global reduction 1 with 8 rules applied. Total rules applied 158 place count 615 transition count 1606
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 165 place count 608 transition count 1592
Iterating global reduction 1 with 7 rules applied. Total rules applied 172 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 605 transition count 1586
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 180 place count 605 transition count 1584
Applied a total of 180 rules in 330 ms. Remains 605 /692 variables (removed 87) and now considering 1584/1800 (removed 216) transitions.
[2024-05-24 07:39:40] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-24 07:39:40] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 07:39:40] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-24 07:39:40] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 07:39:40] [INFO ] Invariant cache hit.
[2024-05-24 07:39:40] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 07:39:42] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 1988 ms to find 0 implicit places.
[2024-05-24 07:39:42] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-24 07:39:42] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 07:39:42] [INFO ] Invariant cache hit.
[2024-05-24 07:39:42] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/692 places, 1584/1800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2812 ms. Remains : 605/692 places, 1584/1800 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s475 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLFireability-14 finished in 2852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 692 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 692/692 places, 1800/1800 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 680 transition count 1774
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 680 transition count 1774
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 680 transition count 1770
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 669 transition count 1744
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 669 transition count 1744
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 60 place count 659 transition count 1710
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 659 transition count 1710
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 79 place count 650 transition count 1680
Iterating global reduction 1 with 9 rules applied. Total rules applied 88 place count 650 transition count 1680
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 97 place count 641 transition count 1662
Iterating global reduction 1 with 9 rules applied. Total rules applied 106 place count 641 transition count 1662
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 115 place count 632 transition count 1642
Iterating global reduction 1 with 9 rules applied. Total rules applied 124 place count 632 transition count 1642
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 133 place count 623 transition count 1622
Iterating global reduction 1 with 9 rules applied. Total rules applied 142 place count 623 transition count 1622
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 150 place count 615 transition count 1606
Iterating global reduction 1 with 8 rules applied. Total rules applied 158 place count 615 transition count 1606
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 165 place count 608 transition count 1592
Iterating global reduction 1 with 7 rules applied. Total rules applied 172 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 605 transition count 1586
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 180 place count 605 transition count 1584
Applied a total of 180 rules in 317 ms. Remains 605 /692 variables (removed 87) and now considering 1584/1800 (removed 216) transitions.
[2024-05-24 07:39:42] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 07:39:42] [INFO ] Invariant cache hit.
[2024-05-24 07:39:43] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-24 07:39:43] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 07:39:43] [INFO ] Invariant cache hit.
[2024-05-24 07:39:43] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 07:39:44] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned []
Implicit Place search using SMT with State Equation took 1988 ms to find 0 implicit places.
[2024-05-24 07:39:44] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-24 07:39:44] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 07:39:44] [INFO ] Invariant cache hit.
[2024-05-24 07:39:45] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/692 places, 1584/1800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2800 ms. Remains : 605/692 places, 1584/1800 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s376 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2834 steps with 19 reset in 20 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLFireability-15 finished in 2869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Found a Lengthening insensitive property : FunctionPointer-PT-c032-LTLFireability-02
Stuttering acceptance computed with spot in 67 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 692 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 692/692 places, 1800/1800 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 681 transition count 1776
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 681 transition count 1776
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 681 transition count 1772
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 671 transition count 1748
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 671 transition count 1748
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 662 transition count 1718
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 662 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 72 place count 654 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 80 place count 654 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 88 place count 646 transition count 1676
Iterating global reduction 1 with 8 rules applied. Total rules applied 96 place count 646 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 638 transition count 1658
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 638 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 120 place count 630 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 128 place count 630 transition count 1640
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 623 transition count 1626
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 623 transition count 1626
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 148 place count 617 transition count 1614
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 614 transition count 1608
Applied a total of 160 rules in 219 ms. Remains 614 /692 variables (removed 78) and now considering 1608/1800 (removed 192) transitions.
[2024-05-24 07:39:45] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 07:39:45] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 07:39:46] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-24 07:39:46] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 07:39:46] [INFO ] Invariant cache hit.
[2024-05-24 07:39:46] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:39:47] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned []
Implicit Place search using SMT with State Equation took 1936 ms to find 0 implicit places.
[2024-05-24 07:39:47] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 07:39:47] [INFO ] Invariant cache hit.
[2024-05-24 07:39:48] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 614/692 places, 1608/1800 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2618 ms. Remains : 614/692 places, 1608/1800 transitions.
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s535 1)), p1:(OR (LT s0 1) (LT s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 9437 steps with 76 reset in 45 ms.
Treatment of property FunctionPointer-PT-c032-LTLFireability-02 finished in 2828 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-24 07:39:48] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8596794395522248665
[2024-05-24 07:39:48] [INFO ] Too many transitions (1800) to apply POR reductions. Disabling POR matrices.
[2024-05-24 07:39:48] [INFO ] Applying decomposition
[2024-05-24 07:39:48] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8596794395522248665
Running compilation step : cd /tmp/ltsmin8596794395522248665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 07:39:48] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5194589708841521035.txt' '-o' '/tmp/graph5194589708841521035.bin' '-w' '/tmp/graph5194589708841521035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5194589708841521035.bin' '-l' '-1' '-v' '-w' '/tmp/graph5194589708841521035.weights' '-q' '0' '-e' '0.001'
[2024-05-24 07:39:48] [INFO ] Decomposing Gal with order
[2024-05-24 07:39:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 07:39:48] [INFO ] Removed a total of 3005 redundant transitions.
[2024-05-24 07:39:48] [INFO ] Flatten gal took : 71 ms
[2024-05-24 07:39:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 1340 labels/synchronizations in 66 ms.
[2024-05-24 07:39:48] [INFO ] Time to serialize gal into /tmp/LTLFireability10392486417394250124.gal : 9 ms
[2024-05-24 07:39:48] [INFO ] Time to serialize properties into /tmp/LTLFireability13599369889150811179.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10392486417394250124.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13599369889150811179.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.u0.s1<1)||(i27.u167.l1634<1))"))))
Formula 0 simplified : FG!"((i4.u0.s1<1)||(i27.u167.l1634<1))"
Compilation finished in 3290 ms.
Running link step : cd /tmp/ltsmin8596794395522248665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8596794395522248665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 08:01:36] [INFO ] Flatten gal took : 125 ms
[2024-05-24 08:01:36] [INFO ] Time to serialize gal into /tmp/LTLFireability262115260535827877.gal : 25 ms
[2024-05-24 08:01:36] [INFO ] Time to serialize properties into /tmp/LTLFireability17732653616640429080.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability262115260535827877.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17732653616640429080.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l1634<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1634<1))"
Detected timeout of ITS tools.
[2024-05-24 08:23:24] [INFO ] Flatten gal took : 129 ms
[2024-05-24 08:23:24] [INFO ] Input system was already deterministic with 1800 transitions.
[2024-05-24 08:23:24] [INFO ] Transformed 692 places.
[2024-05-24 08:23:24] [INFO ] Transformed 1800 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 08:23:24] [INFO ] Time to serialize gal into /tmp/LTLFireability9088434530611710565.gal : 24 ms
[2024-05-24 08:23:24] [INFO ] Time to serialize properties into /tmp/LTLFireability17873014420902471304.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9088434530611710565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17873014420902471304.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((s1<1)||(l1634<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1634<1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.145: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.144: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.151: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.151: Initializing POR dependencies: labels 1803, guards 1800
pins2lts-mc-linux64( 6/ 8), 0.154: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.162: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.162: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.187: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.186: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 49.620: No maybe-coenabled matrix found. Turning off NESs from NDS+MC.
pins2lts-mc-linux64( 4/ 8), 169.605: LTL layer: formula: [](<>((LTLAPp2==true)))
pins2lts-mc-linux64( 4/ 8), 169.605: "[](<>((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 169.606: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 172.160: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 172.348: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 172.388: There are 1805 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 172.388: State length is 693, there are 1803 groups
pins2lts-mc-linux64( 0/ 8), 172.388: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 172.388: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 172.388: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 172.388: Visible groups: 0 / 1803, labels: 1 / 1805
pins2lts-mc-linux64( 0/ 8), 172.388: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 172.388: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 173.247: [Blue] ~120 levels ~960 states ~5328 transitions
pins2lts-mc-linux64( 6/ 8), 174.046: [Blue] ~240 levels ~1920 states ~10488 transitions
pins2lts-mc-linux64( 7/ 8), 175.040: [Blue] ~418 levels ~3840 states ~13736 transitions
pins2lts-mc-linux64( 7/ 8), 175.911: [Blue] ~628 levels ~7680 states ~21816 transitions
pins2lts-mc-linux64( 7/ 8), 177.703: [Blue] ~1046 levels ~15360 states ~37960 transitions
pins2lts-mc-linux64( 7/ 8), 181.079: [Blue] ~1883 levels ~30720 states ~70272 transitions
pins2lts-mc-linux64( 7/ 8), 187.817: [Blue] ~3557 levels ~61440 states ~134848 transitions
pins2lts-mc-linux64( 7/ 8), 200.952: [Blue] ~6905 levels ~122880 states ~264056 transitions
pins2lts-mc-linux64( 7/ 8), 227.104: [Blue] ~13600 levels ~245760 states ~522424 transitions
pins2lts-mc-linux64( 7/ 8), 279.093: [Blue] ~26990 levels ~491520 states ~1039136 transitions
pins2lts-mc-linux64( 7/ 8), 383.817: [Blue] ~53773 levels ~983040 states ~2072600 transitions
pins2lts-mc-linux64( 7/ 8), 590.454: [Blue] ~107336 levels ~1966080 states ~4139480 transitions
pins2lts-mc-linux64( 7/ 8), 1009.752: [Blue] ~214462 levels ~3932160 states ~8273288 transitions
pins2lts-mc-linux64( 7/ 8), 1843.670: [Blue] ~428714 levels ~7864320 states ~16540904 transitions
pins2lts-mc-linux64( 4/ 8), 2641.810: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2641.949:
pins2lts-mc-linux64( 0/ 8), 2641.949: Explored 4304967 states 16478132 transitions, fanout: 3.828
pins2lts-mc-linux64( 0/ 8), 2641.950: Total exploration time 2469.530 sec (2469.410 sec minimum, 2469.466 sec on average)
pins2lts-mc-linux64( 0/ 8), 2641.950: States per second: 1743, Transitions per second: 6673
pins2lts-mc-linux64( 0/ 8), 2641.950:
pins2lts-mc-linux64( 0/ 8), 2641.950: State space has 15971058 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 2641.950: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 2641.950: blue states: 4304967 (26.95%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 2641.950: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 2641.950: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 2641.950:
pins2lts-mc-linux64( 0/ 8), 2641.950: Total memory used for local state coloring: 53.3MB
pins2lts-mc-linux64( 0/ 8), 2641.950:
pins2lts-mc-linux64( 0/ 8), 2641.950: Queue width: 8B, total height: 3490803, memory: 26.63MB
pins2lts-mc-linux64( 0/ 8), 2641.950: Tree memory: 377.8MB, 24.8 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 2641.950: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 2641.950: Stored 2138 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2641.950: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2641.950: Est. total memory use: 404.5MB (~1050.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8596794395522248665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8596794395522248665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4334452 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14977420 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="FunctionPointer-PT-c032"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is FunctionPointer-PT-c032, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625100193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c032.tgz
mv FunctionPointer-PT-c032 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;