About the Execution of ITS-Tools for DoubleExponent-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7675.611 | 3600000.00 | 11083156.00 | 3191.50 | FFTTFFFFFFFFTT?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110000212.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000212
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.8M May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652648604789
Running Version 202205111006
[2022-05-15 21:03:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 21:03:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:03:26] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2022-05-15 21:03:26] [INFO ] Transformed 5304 places.
[2022-05-15 21:03:26] [INFO ] Transformed 4998 transitions.
[2022-05-15 21:03:26] [INFO ] Parsed PT model containing 5304 places and 4998 transitions in 372 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-100-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 5304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 5300 transition count 4998
Applied a total of 4 rules in 1067 ms. Remains 5300 /5304 variables (removed 4) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:03:28] [INFO ] Invariants computation overflowed in 202 ms
[2022-05-15 21:03:30] [INFO ] Implicit Places using invariants in 2346 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:03:30] [INFO ] Invariants computation overflowed in 92 ms
[2022-05-15 21:03:31] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 3567 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:03:32] [INFO ] Invariants computation overflowed in 139 ms
[2022-05-15 21:03:35] [INFO ] Dead Transitions using invariants and state equation in 3048 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5300/5304 places, 4998/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5304 places, 4998/4998 transitions.
Support contains 41 out of 5300 places after structural reductions.
[2022-05-15 21:03:35] [INFO ] Flatten gal took : 306 ms
[2022-05-15 21:03:36] [INFO ] Flatten gal took : 186 ms
[2022-05-15 21:03:36] [INFO ] Input system was already deterministic with 4998 transitions.
Incomplete random walk after 10000 steps, including 326 resets, run finished after 644 ms. (steps per millisecond=15 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 48033 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 48033 steps, saw 24025 distinct states, run finished after 3003 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:03:41] [INFO ] Invariants computation overflowed in 96 ms
[2022-05-15 21:04:07] [INFO ] After 20781ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:26
[2022-05-15 21:04:07] [INFO ] After 20798ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:26
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-15 21:04:07] [INFO ] After 25056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:26
[2022-05-15 21:04:32] [INFO ] After 20745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2022-05-15 21:04:32] [INFO ] After 20746ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-15 21:04:32] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Fused 28 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2007 ms.
Support contains 40 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1168 transitions
Trivial Post-agglo rules discarded 1168 transitions
Performed 1168 trivial Post agglomeration. Transition count delta: 1168
Iterating post reduction 0 with 1171 rules applied. Total rules applied 1172 place count 5297 transition count 3828
Reduce places removed 1168 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 1181 rules applied. Total rules applied 2353 place count 4129 transition count 3815
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 2366 place count 4116 transition count 3815
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2366 place count 4116 transition count 3614
Deduced a syphon composed of 201 places in 222 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2768 place count 3915 transition count 3614
Performed 883 Post agglomeration using F-continuation condition.Transition count delta: 883
Deduced a syphon composed of 883 places in 66 ms
Reduce places removed 883 places and 0 transitions.
Iterating global reduction 3 with 1766 rules applied. Total rules applied 4534 place count 3032 transition count 2731
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 113 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4736 place count 2931 transition count 2731
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 55 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 4916 place count 2841 transition count 2731
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4917 place count 2841 transition count 2730
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4918 place count 2840 transition count 2730
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 4 with 396 rules applied. Total rules applied 5314 place count 2840 transition count 2334
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 4 with 396 rules applied. Total rules applied 5710 place count 2444 transition count 2334
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 5 with 400 rules applied. Total rules applied 6110 place count 2444 transition count 2334
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6111 place count 2443 transition count 2333
Applied a total of 6111 rules in 2404 ms. Remains 2443 /5300 variables (removed 2857) and now considering 2333/4998 (removed 2665) transitions.
Finished structural reductions, in 1 iterations. Remains : 2443/5300 places, 2333/4998 transitions.
Incomplete random walk after 10000 steps, including 1260 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 68902 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68902 steps, saw 34465 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 2333 rows 2443 cols
[2022-05-15 21:04:40] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 21:05:05] [INFO ] After 22775ms SMT Verify possible using state equation in real domain returned unsat :0 sat :24 real:2
[2022-05-15 21:05:05] [INFO ] State equation strengthened by 388 read => feed constraints.
[2022-05-15 21:05:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 21:05:05] [INFO ] After 25059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 28 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2005 ms.
Support contains 40 out of 2443 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2443/2443 places, 2333/2333 transitions.
Applied a total of 0 rules in 150 ms. Remains 2443 /2443 variables (removed 0) and now considering 2333/2333 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2443/2443 places, 2333/2333 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2443/2443 places, 2333/2333 transitions.
Applied a total of 0 rules in 178 ms. Remains 2443 /2443 variables (removed 0) and now considering 2333/2333 (removed 0) transitions.
// Phase 1: matrix 2333 rows 2443 cols
[2022-05-15 21:05:07] [INFO ] Invariants computation overflowed in 64 ms
[2022-05-15 21:05:16] [INFO ] Implicit Places using invariants in 8196 ms returned []
// Phase 1: matrix 2333 rows 2443 cols
[2022-05-15 21:05:16] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-15 21:05:25] [INFO ] Implicit Places using invariants and state equation in 8947 ms returned []
Implicit Place search using SMT with State Equation took 17157 ms to find 0 implicit places.
[2022-05-15 21:05:25] [INFO ] Redundant transitions in 155 ms returned []
// Phase 1: matrix 2333 rows 2443 cols
[2022-05-15 21:05:25] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-15 21:05:26] [INFO ] Dead Transitions using invariants and state equation in 1346 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2443/2443 places, 2333/2333 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.31 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(X(p1)))))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 858 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:05:27] [INFO ] Invariants computation overflowed in 98 ms
[2022-05-15 21:05:29] [INFO ] Implicit Places using invariants in 2095 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:05:29] [INFO ] Invariants computation overflowed in 101 ms
[2022-05-15 21:05:30] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 3206 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:05:30] [INFO ] Invariants computation overflowed in 95 ms
[2022-05-15 21:05:33] [INFO ] Dead Transitions using invariants and state equation in 3079 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s393 1), p0:(GEQ s4936 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 7 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-00 finished in 8031 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 924 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:05:35] [INFO ] Invariants computation overflowed in 97 ms
[2022-05-15 21:05:37] [INFO ] Implicit Places using invariants in 2257 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:05:38] [INFO ] Invariants computation overflowed in 95 ms
[2022-05-15 21:05:38] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 3250 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:05:39] [INFO ] Invariants computation overflowed in 99 ms
[2022-05-15 21:05:42] [INFO ] Dead Transitions using invariants and state equation in 3091 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s124 1) (LT s479 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2987 ms.
Product exploration explored 100000 steps with 50000 reset in 2920 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-100-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-100-LTLFireability-03 finished in 13876 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 830 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:05:49] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-15 21:05:51] [INFO ] Implicit Places using invariants in 2052 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:05:51] [INFO ] Invariants computation overflowed in 95 ms
[2022-05-15 21:05:52] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 3155 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:05:52] [INFO ] Invariants computation overflowed in 121 ms
[2022-05-15 21:05:55] [INFO ] Dead Transitions using invariants and state equation in 3071 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4327 1) (GEQ s4355 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][false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-04 finished in 7636 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5299 transition count 3798
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 219 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 68 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4604 place count 2997 transition count 2695
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 64 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4806 place count 2896 transition count 2695
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 50 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5000 place count 2799 transition count 2695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5001 place count 2798 transition count 2694
Applied a total of 5001 rules in 1459 ms. Remains 2798 /5300 variables (removed 2502) and now considering 2694/4998 (removed 2304) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2022-05-15 21:05:57] [INFO ] Invariants computation overflowed in 50 ms
[2022-05-15 21:05:59] [INFO ] Implicit Places using invariants in 1436 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2022-05-15 21:05:59] [INFO ] Invariants computation overflowed in 66 ms
[2022-05-15 21:06:01] [INFO ] Implicit Places using invariants and state equation in 2248 ms returned []
Implicit Place search using SMT with State Equation took 3700 ms to find 0 implicit places.
[2022-05-15 21:06:01] [INFO ] Redundant transitions in 150 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2022-05-15 21:06:01] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-15 21:06:02] [INFO ] Dead Transitions using invariants and state equation in 1272 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2798/5300 places, 2694/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 2798/5300 places, 2694/4998 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s97 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 9 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-05 finished in 6696 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p0) U (F(p2)||p1)))'
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 850 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:03] [INFO ] Invariants computation overflowed in 92 ms
[2022-05-15 21:06:06] [INFO ] Implicit Places using invariants in 2207 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:06] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-15 21:06:07] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 3192 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:07] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-15 21:06:10] [INFO ] Dead Transitions using invariants and state equation in 3261 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s3867 1) (GEQ s4755 1)) (AND (GEQ s4504 1) (GEQ s4461 1) (GEQ s4541 1))), p2:(GEQ s4504 1), p0:(AND (GEQ s3867 1) (GEQ s4755 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-07 finished in 7885 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U G(p1))))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5299 transition count 3798
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3599
Deduced a syphon composed of 199 places in 196 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 68 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4602 place count 2998 transition count 2696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 61 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4804 place count 2897 transition count 2696
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 50 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 4996 place count 2801 transition count 2696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4997 place count 2800 transition count 2695
Applied a total of 4997 rules in 1606 ms. Remains 2800 /5300 variables (removed 2500) and now considering 2695/4998 (removed 2303) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2022-05-15 21:06:12] [INFO ] Invariants computation overflowed in 58 ms
[2022-05-15 21:06:14] [INFO ] Implicit Places using invariants in 1610 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2022-05-15 21:06:14] [INFO ] Invariants computation overflowed in 59 ms
[2022-05-15 21:06:16] [INFO ] Implicit Places using invariants and state equation in 2163 ms returned []
Implicit Place search using SMT with State Equation took 3793 ms to find 0 implicit places.
[2022-05-15 21:06:16] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2022-05-15 21:06:16] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-15 21:06:17] [INFO ] Dead Transitions using invariants and state equation in 1649 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/5300 places, 2695/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 2800/5300 places, 2695/4998 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1508 1), p0:(GEQ s887 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 3 reset in 1 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-08 finished in 7312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(p0)))&&F(p1)))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1194 place count 5299 transition count 3803
Reduce places removed 1194 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2390 place count 4105 transition count 3801
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2392 place count 4103 transition count 3801
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 2392 place count 4103 transition count 3602
Deduced a syphon composed of 199 places in 188 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 2790 place count 3904 transition count 3602
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 71 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 3 with 1806 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 54 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 52 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 4986 place count 2806 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4987 place count 2805 transition count 2698
Applied a total of 4987 rules in 1328 ms. Remains 2805 /5300 variables (removed 2495) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2805 cols
[2022-05-15 21:06:19] [INFO ] Invariants computation overflowed in 58 ms
[2022-05-15 21:06:20] [INFO ] Implicit Places using invariants in 1484 ms returned []
// Phase 1: matrix 2698 rows 2805 cols
[2022-05-15 21:06:21] [INFO ] Invariants computation overflowed in 57 ms
[2022-05-15 21:06:23] [INFO ] Implicit Places using invariants and state equation in 2203 ms returned []
Implicit Place search using SMT with State Equation took 3716 ms to find 0 implicit places.
[2022-05-15 21:06:23] [INFO ] Redundant transitions in 84 ms returned []
// Phase 1: matrix 2698 rows 2805 cols
[2022-05-15 21:06:23] [INFO ] Invariants computation overflowed in 55 ms
[2022-05-15 21:06:24] [INFO ] Dead Transitions using invariants and state equation in 1470 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2805/5300 places, 2698/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 2805/5300 places, 2698/4998 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1093 1) (GEQ s1112 1)), p1:(AND (OR (GEQ s1705 1) (GEQ s2109 1)) (GEQ s1705 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-09 finished in 6802 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(!X(X(X(G(!F(p1))))))||p1)))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5299 transition count 3801
Reduce places removed 1196 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2394 place count 4103 transition count 3799
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3598
Deduced a syphon composed of 201 places in 216 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 67 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 3 with 1796 rules applied. Total rules applied 4594 place count 3002 transition count 2700
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 54 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4796 place count 2901 transition count 2700
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 52 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4990 place count 2804 transition count 2700
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 4992 place count 2804 transition count 2700
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4993 place count 2803 transition count 2699
Applied a total of 4993 rules in 1512 ms. Remains 2803 /5300 variables (removed 2497) and now considering 2699/4998 (removed 2299) transitions.
// Phase 1: matrix 2699 rows 2803 cols
[2022-05-15 21:06:26] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-15 21:06:27] [INFO ] Implicit Places using invariants in 1431 ms returned []
// Phase 1: matrix 2699 rows 2803 cols
[2022-05-15 21:06:27] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-15 21:06:30] [INFO ] Implicit Places using invariants and state equation in 2232 ms returned []
Implicit Place search using SMT with State Equation took 3697 ms to find 0 implicit places.
[2022-05-15 21:06:30] [INFO ] Redundant transitions in 84 ms returned []
// Phase 1: matrix 2699 rows 2803 cols
[2022-05-15 21:06:30] [INFO ] Invariants computation overflowed in 47 ms
[2022-05-15 21:06:31] [INFO ] Dead Transitions using invariants and state equation in 1287 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5300 places, 2699/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 2803/5300 places, 2699/4998 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1903 1) (GEQ s1965 1)), p0:(LT s328 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-10 finished in 6780 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||F(X(F(p1)))))'
Support contains 7 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 846 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:32] [INFO ] Invariants computation overflowed in 97 ms
[2022-05-15 21:06:34] [INFO ] Implicit Places using invariants in 2060 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:34] [INFO ] Invariants computation overflowed in 115 ms
[2022-05-15 21:06:35] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 3060 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:35] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-15 21:06:38] [INFO ] Dead Transitions using invariants and state equation in 3130 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(AND (GEQ s73 1) (GEQ s99 1)), p1:(OR (GEQ s5011 1) (AND (GEQ s2517 1) (GEQ s2598 1)) (AND (GEQ s1397 1) (GEQ s1424 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-11 finished in 7601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((p0 U X(!(X(G(p1)) U p2))))||!p1))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 830 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:40] [INFO ] Invariants computation overflowed in 117 ms
[2022-05-15 21:06:42] [INFO ] Implicit Places using invariants in 2139 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:42] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-15 21:06:43] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 3187 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:43] [INFO ] Invariants computation overflowed in 89 ms
[2022-05-15 21:06:46] [INFO ] Dead Transitions using invariants and state equation in 3041 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 349 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), p2, p2, p2, true, (AND p1 p2), p1, (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={} source=4 dest: 6}, { cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p1 p2), acceptance={} source=7 dest: 8}], [{ cond=p1, acceptance={0} source=8 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND p1 p0 p2), acceptance={0} source=9 dest: 10}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=10 dest: 9}, { cond=(AND p1 p0 p2), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p1:(GEQ s5299 1), p0:(GEQ s2845 1), p2:(GEQ s1174 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1981 ms.
Product exploration explored 100000 steps with 33333 reset in 1998 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 11 states, 21 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-100-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-100-LTLFireability-12 finished in 11979 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(!((p0 U X(p1)) U p2)))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 832 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:52] [INFO ] Invariants computation overflowed in 112 ms
[2022-05-15 21:06:54] [INFO ] Implicit Places using invariants in 2079 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:54] [INFO ] Invariants computation overflowed in 88 ms
[2022-05-15 21:06:55] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 3048 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:55] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-15 21:06:58] [INFO ] Dead Transitions using invariants and state equation in 3059 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 387 ms :[true, p1, p2, (AND p1 p2), (AND p1 p2), p1, p2, p2, p2]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 2}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p1:(GEQ s535 1), p2:(GEQ s509 1), p0:(GEQ s92 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 1292 ms.
Product exploration explored 100000 steps with 20000 reset in 1362 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 9 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 344 ms :[true, p1, p2, (AND p1 p2), (AND p1 p2), p1, p2, p2, p2]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 271 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 297 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 98417 steps, run timeout after 6001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 98417 steps, saw 49214 distinct states, run finished after 6001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:07:11] [INFO ] Invariants computation overflowed in 89 ms
[2022-05-15 21:07:36] [INFO ] After 23362ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:8
[2022-05-15 21:07:36] [INFO ] After 23369ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:8
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 21:07:36] [INFO ] After 25050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:8
[2022-05-15 21:08:01] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3598
Deduced a syphon composed of 199 places in 193 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 2800 place count 3899 transition count 3598
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 66 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 2 with 1810 rules applied. Total rules applied 4610 place count 2994 transition count 2693
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 60 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4812 place count 2893 transition count 2693
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 56 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 5004 place count 2797 transition count 2693
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 5401 place count 2797 transition count 2296
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 5798 place count 2400 transition count 2296
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 401 times.
Drop transitions removed 401 transitions
Iterating global reduction 3 with 401 rules applied. Total rules applied 6199 place count 2400 transition count 2296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6200 place count 2399 transition count 2295
Applied a total of 6200 rules in 1854 ms. Remains 2399 /5300 variables (removed 2901) and now considering 2295/4998 (removed 2703) transitions.
Finished structural reductions, in 1 iterations. Remains : 2399/5300 places, 2295/4998 transitions.
Incomplete random walk after 10000 steps, including 1315 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 810 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 874 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 871 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 87336 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87336 steps, saw 43682 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2022-05-15 21:08:07] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 21:08:32] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-15 21:08:56] [INFO ] After 22889ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2022-05-15 21:08:56] [INFO ] State equation strengthened by 398 read => feed constraints.
[2022-05-15 21:08:58] [INFO ] After 1141ms SMT Verify possible using 398 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2022-05-15 21:08:58] [INFO ] After 1142ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-15 21:08:58] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 4006 ms.
Support contains 3 out of 2399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 191 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2399/2399 places, 2295/2295 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true, (G (NOT (AND p1 p2))), (G (NOT (AND p1 (NOT p2) p0))), (G (NOT (AND (NOT p1) p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) p1), (OR (NOT p2) (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) p1), (OR (NOT p2) (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 824 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:09:04] [INFO ] Invariants computation overflowed in 113 ms
[2022-05-15 21:09:06] [INFO ] Implicit Places using invariants in 2165 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:09:06] [INFO ] Invariants computation overflowed in 108 ms
[2022-05-15 21:09:07] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 3147 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:09:07] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-15 21:09:10] [INFO ] Dead Transitions using invariants and state equation in 3223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) (NOT p2))), (X (X (OR (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 7 states, 9 edges and 3 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p2) (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 329 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 48386 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 48386 steps, saw 24202 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:09:15] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-15 21:09:41] [INFO ] After 25044ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 21:10:06] [INFO ] After 24056ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 21:10:06] [INFO ] After 24062ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-15 21:10:06] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3598
Deduced a syphon composed of 199 places in 193 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 2800 place count 3899 transition count 3598
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 66 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 2 with 1810 rules applied. Total rules applied 4610 place count 2994 transition count 2693
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 59 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4812 place count 2893 transition count 2693
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 56 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 5004 place count 2797 transition count 2693
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 5401 place count 2797 transition count 2296
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 5798 place count 2400 transition count 2296
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 401 times.
Drop transitions removed 401 transitions
Iterating global reduction 3 with 401 rules applied. Total rules applied 6199 place count 2400 transition count 2296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6200 place count 2399 transition count 2295
Applied a total of 6200 rules in 1737 ms. Remains 2399 /5300 variables (removed 2901) and now considering 2295/4998 (removed 2703) transitions.
Finished structural reductions, in 1 iterations. Remains : 2399/5300 places, 2295/4998 transitions.
Incomplete random walk after 10000 steps, including 1298 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 90537 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90537 steps, saw 45309 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2022-05-15 21:10:11] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 21:10:34] [INFO ] After 22430ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-15 21:10:59] [INFO ] After 24635ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-15 21:10:59] [INFO ] State equation strengthened by 398 read => feed constraints.
[2022-05-15 21:10:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 21:10:59] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 2399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 192 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2399/2399 places, 2295/2295 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) (NOT p2))), (X (X (OR (NOT p0) (NOT p2)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 7 states, 9 edges and 3 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 268 ms :[true, (AND p1 (NOT p0)), p2, (AND p1 (NOT p0) p2), p2, p2, p2]
Stuttering acceptance computed with spot in 249 ms :[true, (AND p1 (NOT p0)), p2, (AND p1 (NOT p0) p2), p2, p2, p2]
Stuttering acceptance computed with spot in 233 ms :[true, (AND p1 (NOT p0)), p2, (AND p1 (NOT p0) p2), p2, p2, p2]
Product exploration explored 100000 steps with 25000 reset in 1629 ms.
Product exploration explored 100000 steps with 25000 reset in 1670 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 311 ms :[true, (AND p1 (NOT p0)), p2, (AND p1 (NOT p0) p2), p2, p2, p2]
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Performed 1197 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1197 rules applied. Total rules applied 1197 place count 5300 transition count 4998
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 1197 place count 5300 transition count 5197
Deduced a syphon composed of 1397 places in 262 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 1397 place count 5300 transition count 5197
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1399 place count 5298 transition count 5195
Deduced a syphon composed of 1395 places in 222 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1401 place count 5298 transition count 5195
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: -200
Deduced a syphon composed of 2297 places in 160 ms
Iterating global reduction 1 with 902 rules applied. Total rules applied 2303 place count 5298 transition count 5395
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2304 place count 5297 transition count 5394
Deduced a syphon composed of 2296 places in 139 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2305 place count 5297 transition count 5394
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -658
Deduced a syphon composed of 2397 places in 147 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2406 place count 5297 transition count 6052
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 2507 place count 5196 transition count 5850
Deduced a syphon composed of 2296 places in 162 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2608 place count 5196 transition count 5850
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -624
Deduced a syphon composed of 2394 places in 145 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 2706 place count 5196 transition count 6474
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 2804 place count 5098 transition count 6278
Deduced a syphon composed of 2296 places in 134 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 2902 place count 5098 transition count 6278
Deduced a syphon composed of 2296 places in 134 ms
Applied a total of 2902 rules in 4722 ms. Remains 5098 /5300 variables (removed 202) and now considering 6278/4998 (removed -1280) transitions.
[2022-05-15 21:11:09] [INFO ] Redundant transitions in 418 ms returned []
// Phase 1: matrix 6278 rows 5098 cols
[2022-05-15 21:11:09] [INFO ] Invariants computation overflowed in 150 ms
[2022-05-15 21:11:13] [INFO ] Dead Transitions using invariants and state equation in 3952 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5098/5300 places, 6278/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5098/5300 places, 6278/4998 transitions.
Product exploration explored 100000 steps with 25000 reset in 1506 ms.
Product exploration explored 100000 steps with 25000 reset in 1561 ms.
Built C files in :
/tmp/ltsmin16743057482770543409
[2022-05-15 21:11:16] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16743057482770543409
Running compilation step : cd /tmp/ltsmin16743057482770543409;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16743057482770543409;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16743057482770543409;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 939 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:11:20] [INFO ] Invariants computation overflowed in 143 ms
[2022-05-15 21:11:23] [INFO ] Implicit Places using invariants in 3619 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:11:24] [INFO ] Invariants computation overflowed in 104 ms
[2022-05-15 21:11:26] [INFO ] Implicit Places using invariants and state equation in 2047 ms returned []
Implicit Place search using SMT with State Equation took 5694 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:11:26] [INFO ] Invariants computation overflowed in 114 ms
[2022-05-15 21:11:31] [INFO ] Dead Transitions using invariants and state equation in 5927 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Built C files in :
/tmp/ltsmin7940450601265578379
[2022-05-15 21:11:32] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7940450601265578379
Running compilation step : cd /tmp/ltsmin7940450601265578379;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7940450601265578379;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7940450601265578379;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:11:37] [INFO ] Flatten gal took : 332 ms
[2022-05-15 21:11:37] [INFO ] Flatten gal took : 312 ms
[2022-05-15 21:11:37] [INFO ] Time to serialize gal into /tmp/LTL12801936791535672752.gal : 91 ms
[2022-05-15 21:11:37] [INFO ] Time to serialize properties into /tmp/LTL3388155313604631762.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12801936791535672752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3388155313604631762.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1280193...267
Read 1 LTL properties
Checking formula 0 : !((X(X(X(!((("(p1081>=1)")U(X("(p1480>=1)")))U("(p1457>=1)")))))))
Formula 0 simplified : !XXX!(("(p1081>=1)" U X"(p1480>=1)") U "(p1457>=1)")
Detected timeout of ITS tools.
[2022-05-15 21:11:53] [INFO ] Flatten gal took : 145 ms
[2022-05-15 21:11:53] [INFO ] Applying decomposition
[2022-05-15 21:11:53] [INFO ] Flatten gal took : 165 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1477256216940808458.txt' '-o' '/tmp/graph1477256216940808458.bin' '-w' '/tmp/graph1477256216940808458.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1477256216940808458.bin' '-l' '-1' '-v' '-w' '/tmp/graph1477256216940808458.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:11:53] [INFO ] Decomposing Gal with order
[2022-05-15 21:11:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:11:56] [INFO ] Removed a total of 1447 redundant transitions.
[2022-05-15 21:11:56] [INFO ] Flatten gal took : 725 ms
[2022-05-15 21:11:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 238 ms.
[2022-05-15 21:11:57] [INFO ] Time to serialize gal into /tmp/LTL5299026399456996284.gal : 99 ms
[2022-05-15 21:11:57] [INFO ] Time to serialize properties into /tmp/LTL18090747731669340454.ltl : 42 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5299026399456996284.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18090747731669340454.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5299026...246
Read 1 LTL properties
Checking formula 0 : !((X(X(X(!((("(i0.u40.p1081>=1)")U(X("(i2.u218.p1480>=1)")))U("(i2.u209.p1457>=1)")))))))
Formula 0 simplified : !XXX!(("(i0.u40.p1081>=1)" U X"(i2.u218.p1480>=1)") U "(i2.u209.p1457>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3172259070144056619
[2022-05-15 21:12:12] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3172259070144056619
Running compilation step : cd /tmp/ltsmin3172259070144056619;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3172259070144056619;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3172259070144056619;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleExponent-PT-100-LTLFireability-13 finished in 323962 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!((G(p0) U p1) U p1)||G(X(G(p2))))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 999 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:12:16] [INFO ] Invariants computation overflowed in 89 ms
[2022-05-15 21:12:20] [INFO ] Implicit Places using invariants in 3828 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:12:20] [INFO ] Invariants computation overflowed in 103 ms
[2022-05-15 21:12:22] [INFO ] Implicit Places using invariants and state equation in 2037 ms returned []
Implicit Place search using SMT with State Equation took 5891 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:12:22] [INFO ] Invariants computation overflowed in 103 ms
[2022-05-15 21:12:27] [INFO ] Dead Transitions using invariants and state equation in 5786 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 289 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 p1)), (OR (NOT p2) p0), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GEQ s1740 1), p1:(GEQ s2408 1), p2:(AND (LT s1740 1) (LT s3468 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3304 reset in 308 ms.
Product exploration explored 100000 steps with 3336 reset in 276 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (AND (NOT p0) p2))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 996 ms. Reduced automaton from 6 states, 18 edges and 3 AP to 6 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 397 ms :[true, (OR (NOT p2) p0), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 p1)), (AND p1 (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 294 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 295 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 97825 steps, run timeout after 6001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 97825 steps, saw 48919 distinct states, run finished after 6001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:12:40] [INFO ] Invariants computation overflowed in 89 ms
[2022-05-15 21:13:05] [INFO ] After 23604ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:8
[2022-05-15 21:13:05] [INFO ] After 23608ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1 real:8
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-15 21:13:05] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :1 real:8
[2022-05-15 21:13:30] [INFO ] After 22883ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-15 21:13:30] [INFO ] After 22884ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2022-05-15 21:13:30] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2001 ms.
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1203 rules applied. Total rules applied 1204 place count 5297 transition count 3796
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2404 place count 4097 transition count 3796
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2404 place count 4097 transition count 3596
Deduced a syphon composed of 200 places in 194 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2804 place count 3897 transition count 3596
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 65 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4610 place count 2994 transition count 2693
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 59 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4812 place count 2893 transition count 2693
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 55 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 5004 place count 2797 transition count 2693
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 5401 place count 2797 transition count 2296
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 5798 place count 2400 transition count 2296
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 3 with 400 rules applied. Total rules applied 6198 place count 2400 transition count 2296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6199 place count 2399 transition count 2295
Applied a total of 6199 rules in 1931 ms. Remains 2399 /5300 variables (removed 2901) and now considering 2295/4998 (removed 2703) transitions.
Finished structural reductions, in 1 iterations. Remains : 2399/5300 places, 2295/4998 transitions.
Incomplete random walk after 10000 steps, including 1265 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 870 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 815 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 92075 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92075 steps, saw 46079 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2022-05-15 21:13:38] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 21:13:39] [INFO ] After 715ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-15 21:14:01] [INFO ] After 21322ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2022-05-15 21:14:01] [INFO ] State equation strengthened by 397 read => feed constraints.
[2022-05-15 21:14:04] [INFO ] After 2790ms SMT Verify possible using 397 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2022-05-15 21:14:04] [INFO ] After 2791ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-15 21:14:04] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1084 ms.
Support contains 3 out of 2399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 215 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2399/2399 places, 2295/2295 transitions.
Incomplete random walk after 10000 steps, including 1327 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 76398 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76398 steps, saw 38215 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2022-05-15 21:14:10] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-15 21:14:11] [INFO ] After 590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-15 21:14:31] [INFO ] After 19770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-15 21:14:31] [INFO ] State equation strengthened by 397 read => feed constraints.
[2022-05-15 21:14:36] [INFO ] After 4463ms SMT Verify possible using 397 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-15 21:14:36] [INFO ] After 4463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 21:14:36] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1365 ms.
Support contains 3 out of 2399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 236 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2399/2399 places, 2295/2295 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 233 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2399 cols
[2022-05-15 21:14:38] [INFO ] Invariants computation overflowed in 54 ms
[2022-05-15 21:15:00] [INFO ] Implicit Places using invariants in 22105 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2022-05-15 21:15:00] [INFO ] Invariants computation overflowed in 52 ms
[2022-05-15 21:15:22] [INFO ] Implicit Places using invariants and state equation in 22246 ms returned []
Implicit Place search using SMT with State Equation took 44360 ms to find 0 implicit places.
[2022-05-15 21:15:22] [INFO ] Redundant transitions in 100 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2022-05-15 21:15:22] [INFO ] Invariants computation overflowed in 47 ms
[2022-05-15 21:15:24] [INFO ] Dead Transitions using invariants and state equation in 1532 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2399/2399 places, 2295/2295 transitions.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (AND (NOT p0) p2))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (G (NOT (AND p0 p1))), (G (NOT (AND p2 p0))), (G (NOT (AND (NOT p2) p0 p1))), (G (NOT (AND p2 p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1054 ms. Reduced automaton from 6 states, 18 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 907 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:15:26] [INFO ] Invariants computation overflowed in 98 ms
[2022-05-15 21:15:28] [INFO ] Implicit Places using invariants in 2084 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:15:28] [INFO ] Invariants computation overflowed in 88 ms
[2022-05-15 21:15:29] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 3070 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:15:29] [INFO ] Invariants computation overflowed in 89 ms
[2022-05-15 21:15:32] [INFO ] Dead Transitions using invariants and state equation in 3088 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT p1)), (X (X p2)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 236 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 327 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 50965 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 50965 steps, saw 25491 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:15:37] [INFO ] Invariants computation overflowed in 89 ms
[2022-05-15 21:16:02] [INFO ] After 24338ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 21:16:02] [INFO ] After 24340ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 21:16:02] [INFO ] After 25043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1203 rules applied. Total rules applied 1204 place count 5297 transition count 3796
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2404 place count 4097 transition count 3796
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2404 place count 4097 transition count 3596
Deduced a syphon composed of 200 places in 213 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2804 place count 3897 transition count 3596
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 66 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4610 place count 2994 transition count 2693
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 55 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4812 place count 2893 transition count 2693
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 50 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 5004 place count 2797 transition count 2693
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 5401 place count 2797 transition count 2296
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 5798 place count 2400 transition count 2296
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 3 with 400 rules applied. Total rules applied 6198 place count 2400 transition count 2296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6199 place count 2399 transition count 2295
Applied a total of 6199 rules in 1905 ms. Remains 2399 /5300 variables (removed 2901) and now considering 2295/4998 (removed 2703) transitions.
Finished structural reductions, in 1 iterations. Remains : 2399/5300 places, 2295/4998 transitions.
Incomplete random walk after 10000 steps, including 1251 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 871 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 101311 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101311 steps, saw 50700 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2022-05-15 21:16:07] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 21:16:21] [INFO ] After 13755ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 21:16:21] [INFO ] State equation strengthened by 397 read => feed constraints.
[2022-05-15 21:16:31] [INFO ] After 9587ms SMT Verify possible using 397 Read/Feed constraints in real domain returned unsat :0 sat :0
[2022-05-15 21:16:31] [INFO ] After 23736ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 83 ms.
Support contains 3 out of 2399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 212 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2399/2399 places, 2295/2295 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 200 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2399 cols
[2022-05-15 21:16:32] [INFO ] Invariants computation overflowed in 51 ms
[2022-05-15 21:16:53] [INFO ] Implicit Places using invariants in 21507 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2022-05-15 21:16:53] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-15 21:17:16] [INFO ] Implicit Places using invariants and state equation in 22450 ms returned []
Implicit Place search using SMT with State Equation took 43996 ms to find 0 implicit places.
[2022-05-15 21:17:16] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2022-05-15 21:17:16] [INFO ] Invariants computation overflowed in 67 ms
[2022-05-15 21:17:17] [INFO ] Dead Transitions using invariants and state equation in 1546 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2399/2399 places, 2295/2295 transitions.
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT p1)), (X (X p2)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 184 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 72 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 3310 reset in 248 ms.
Product exploration explored 100000 steps with 3322 reset in 257 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 67 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Performed 1198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5300 transition count 4998
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 1198 place count 5300 transition count 5197
Deduced a syphon composed of 1399 places in 259 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 1399 place count 5300 transition count 5197
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1401 place count 5298 transition count 5195
Deduced a syphon composed of 1397 places in 221 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1403 place count 5298 transition count 5195
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: -199
Deduced a syphon composed of 2297 places in 166 ms
Iterating global reduction 1 with 900 rules applied. Total rules applied 2303 place count 5298 transition count 5394
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2304 place count 5297 transition count 5393
Deduced a syphon composed of 2296 places in 141 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2305 place count 5297 transition count 5393
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -659
Deduced a syphon composed of 2397 places in 147 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2406 place count 5297 transition count 6052
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 2507 place count 5196 transition count 5850
Deduced a syphon composed of 2296 places in 136 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2608 place count 5196 transition count 5850
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -624
Deduced a syphon composed of 2394 places in 151 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 2706 place count 5196 transition count 6474
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 2804 place count 5098 transition count 6278
Deduced a syphon composed of 2296 places in 133 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 2902 place count 5098 transition count 6278
Deduced a syphon composed of 2296 places in 152 ms
Applied a total of 2902 rules in 4278 ms. Remains 5098 /5300 variables (removed 202) and now considering 6278/4998 (removed -1280) transitions.
[2022-05-15 21:17:23] [INFO ] Redundant transitions in 423 ms returned []
// Phase 1: matrix 6278 rows 5098 cols
[2022-05-15 21:17:23] [INFO ] Invariants computation overflowed in 122 ms
[2022-05-15 21:17:27] [INFO ] Dead Transitions using invariants and state equation in 3650 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5098/5300 places, 6278/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5098/5300 places, 6278/4998 transitions.
Product exploration explored 100000 steps with 3352 reset in 241 ms.
Product exploration explored 100000 steps with 3339 reset in 262 ms.
Built C files in :
/tmp/ltsmin14577908192246827187
[2022-05-15 21:17:27] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14577908192246827187
Running compilation step : cd /tmp/ltsmin14577908192246827187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14577908192246827187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14577908192246827187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 950 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:17:31] [INFO ] Invariants computation overflowed in 117 ms
[2022-05-15 21:17:34] [INFO ] Implicit Places using invariants in 3023 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:17:34] [INFO ] Invariants computation overflowed in 101 ms
[2022-05-15 21:17:36] [INFO ] Implicit Places using invariants and state equation in 2064 ms returned []
Implicit Place search using SMT with State Equation took 5140 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:17:36] [INFO ] Invariants computation overflowed in 89 ms
[2022-05-15 21:17:42] [INFO ] Dead Transitions using invariants and state equation in 5683 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Built C files in :
/tmp/ltsmin17933920123242773345
[2022-05-15 21:17:43] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17933920123242773345
Running compilation step : cd /tmp/ltsmin17933920123242773345;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17933920123242773345;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17933920123242773345;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:17:47] [INFO ] Flatten gal took : 131 ms
[2022-05-15 21:17:47] [INFO ] Flatten gal took : 132 ms
[2022-05-15 21:17:47] [INFO ] Time to serialize gal into /tmp/LTL15976411249471824142.gal : 12 ms
[2022-05-15 21:17:47] [INFO ] Time to serialize properties into /tmp/LTL8648763098214603456.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15976411249471824142.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8648763098214603456.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1597641...267
Read 1 LTL properties
Checking formula 0 : !((G((!(((G("(p2565>=1)"))U("(p3166>=1)"))U("(p3166>=1)")))||(G(X(G("((p2565<1)&&(p412<1))")))))))
Formula 0 simplified : !G(!((G"(p2565>=1)" U "(p3166>=1)") U "(p3166>=1)") | GXG"((p2565<1)&&(p412<1))")
Detected timeout of ITS tools.
[2022-05-15 21:18:02] [INFO ] Flatten gal took : 134 ms
[2022-05-15 21:18:02] [INFO ] Applying decomposition
[2022-05-15 21:18:02] [INFO ] Flatten gal took : 143 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3023956204051576035.txt' '-o' '/tmp/graph3023956204051576035.bin' '-w' '/tmp/graph3023956204051576035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3023956204051576035.bin' '-l' '-1' '-v' '-w' '/tmp/graph3023956204051576035.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:18:03] [INFO ] Decomposing Gal with order
[2022-05-15 21:18:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:18:04] [INFO ] Removed a total of 1429 redundant transitions.
[2022-05-15 21:18:04] [INFO ] Flatten gal took : 286 ms
[2022-05-15 21:18:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 91 ms.
[2022-05-15 21:18:04] [INFO ] Time to serialize gal into /tmp/LTL16868543837931552386.gal : 112 ms
[2022-05-15 21:18:04] [INFO ] Time to serialize properties into /tmp/LTL6168206056068641999.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16868543837931552386.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6168206056068641999.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1686854...246
Read 1 LTL properties
Checking formula 0 : !((G((!(((G("(i11.i1.i0.i1.u763.p2565>=1)"))U("(i15.i1.i2.i3.u1055.p3166>=1)"))U("(i15.i1.i2.i3.u1055.p3166>=1)")))||(G(X(G("((i11.i1....203
Formula 0 simplified : !G(!((G"(i11.i1.i0.i1.u763.p2565>=1)" U "(i15.i1.i2.i3.u1055.p3166>=1)") U "(i15.i1.i2.i3.u1055.p3166>=1)") | GXG"((i11.i1.i0.i1.u76...188
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12035917548461197748
[2022-05-15 21:18:19] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12035917548461197748
Running compilation step : cd /tmp/ltsmin12035917548461197748;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12035917548461197748;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12035917548461197748;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleExponent-PT-100-LTLFireability-14 finished in 367634 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F((F((F(p0)||p1))&&G(X(p2))))))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5299 transition count 3799
Reduce places removed 1198 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2398 place count 4101 transition count 3797
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2400 place count 4099 transition count 3797
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 2400 place count 4099 transition count 3598
Deduced a syphon composed of 199 places in 196 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 67 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 3 with 1798 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 61 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 49 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4990 place count 2804 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4991 place count 2803 transition count 2698
Applied a total of 4991 rules in 1436 ms. Remains 2803 /5300 variables (removed 2497) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2803 cols
[2022-05-15 21:18:24] [INFO ] Invariants computation overflowed in 49 ms
[2022-05-15 21:18:25] [INFO ] Implicit Places using invariants in 1340 ms returned []
// Phase 1: matrix 2698 rows 2803 cols
[2022-05-15 21:18:25] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 21:18:27] [INFO ] Implicit Places using invariants and state equation in 2134 ms returned []
Implicit Place search using SMT with State Equation took 3485 ms to find 0 implicit places.
[2022-05-15 21:18:27] [INFO ] Redundant transitions in 86 ms returned []
// Phase 1: matrix 2698 rows 2803 cols
[2022-05-15 21:18:27] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 21:18:29] [INFO ] Dead Transitions using invariants and state equation in 1276 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5300 places, 2698/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 2803/5300 places, 2698/4998 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s792 1), p1:(LT s2443 1), p2:(AND (GEQ s1081 1) (GEQ s1123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-15 finished in 6473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(!((p0 U X(p1)) U p2)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!((G(p0) U p1) U p1)||G(X(G(p2))))))'
Found a SL insensitive property : DoubleExponent-PT-100-LTLFireability-14
Stuttering acceptance computed with spot in 168 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 p1)), (OR (NOT p2) p0), (NOT p2)]
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5299 transition count 3798
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 199 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 66 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 2 with 1802 rules applied. Total rules applied 4600 place count 2999 transition count 2697
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 60 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4802 place count 2898 transition count 2697
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 53 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 4994 place count 2802 transition count 2697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4995 place count 2801 transition count 2696
Applied a total of 4995 rules in 1427 ms. Remains 2801 /5300 variables (removed 2499) and now considering 2696/4998 (removed 2302) transitions.
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:18:31] [INFO ] Invariants computation overflowed in 54 ms
[2022-05-15 21:18:32] [INFO ] Implicit Places using invariants in 1463 ms returned []
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:18:32] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-15 21:18:34] [INFO ] Implicit Places using invariants and state equation in 2224 ms returned []
Implicit Place search using SMT with State Equation took 3698 ms to find 0 implicit places.
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:18:34] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 21:18:36] [INFO ] Dead Transitions using invariants and state equation in 1296 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2801/5300 places, 2696/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 2801/5300 places, 2696/4998 transitions.
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GEQ s919 1), p1:(GEQ s1271 1), p2:(AND (LT s919 1) (LT s1830 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13861 reset in 186 ms.
Product exploration explored 100000 steps with 13922 reset in 199 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8874 edges and 2801 vertex of which 2799 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (AND (NOT p0) p2))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 851 ms. Reduced automaton from 6 states, 18 edges and 3 AP to 6 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 186 ms :[true, (OR (NOT p2) p0), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 p1)), (AND p1 (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 1404 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 823 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 800 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 803 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 821 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 822 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 63754 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63754 steps, saw 31882 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:18:42] [INFO ] Invariants computation overflowed in 48 ms
[2022-05-15 21:18:43] [INFO ] After 821ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:10
[2022-05-15 21:19:08] [INFO ] After 23985ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2022-05-15 21:19:08] [INFO ] State equation strengthened by 198 read => feed constraints.
[2022-05-15 21:19:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 21:19:08] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:10
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 2801 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2801/2801 places, 2696/2696 transitions.
Graph (complete) has 8474 edges and 2801 vertex of which 2799 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2799 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2799 transition count 2693
Deduced a syphon composed of 1 places in 48 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2798 transition count 2693
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2798 transition count 2297
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1196 place count 2402 transition count 2297
Applied a total of 1196 rules in 688 ms. Remains 2402 /2801 variables (removed 399) and now considering 2297/2696 (removed 399) transitions.
Finished structural reductions, in 1 iterations. Remains : 2402/2801 places, 2297/2696 transitions.
Incomplete random walk after 10000 steps, including 1270 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 785 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 811 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 819 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 83516 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83516 steps, saw 41778 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2297 rows 2402 cols
[2022-05-15 21:19:14] [INFO ] Invariants computation overflowed in 55 ms
[2022-05-15 21:19:14] [INFO ] After 787ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-15 21:19:39] [INFO ] After 24077ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-15 21:19:39] [INFO ] State equation strengthened by 397 read => feed constraints.
[2022-05-15 21:19:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 21:19:39] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 266 ms.
Support contains 3 out of 2402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 213 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2402/2402 places, 2297/2297 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 207 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2402 cols
[2022-05-15 21:19:40] [INFO ] Invariants computation overflowed in 60 ms
[2022-05-15 21:20:02] [INFO ] Implicit Places using invariants in 22243 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2022-05-15 21:20:02] [INFO ] Invariants computation overflowed in 63 ms
[2022-05-15 21:20:25] [INFO ] Implicit Places using invariants and state equation in 22997 ms returned []
Implicit Place search using SMT with State Equation took 45257 ms to find 0 implicit places.
[2022-05-15 21:20:26] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2022-05-15 21:20:26] [INFO ] Invariants computation overflowed in 57 ms
[2022-05-15 21:20:27] [INFO ] Dead Transitions using invariants and state equation in 1583 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2402/2402 places, 2297/2297 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (AND (NOT p0) p2))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (G (NOT (AND p2 p0))), (G (NOT (AND p2 p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1067 ms. Reduced automaton from 6 states, 18 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 105 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Support contains 3 out of 2801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2801/2801 places, 2696/2696 transitions.
Applied a total of 0 rules in 132 ms. Remains 2801 /2801 variables (removed 0) and now considering 2696/2696 (removed 0) transitions.
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:20:29] [INFO ] Invariants computation overflowed in 54 ms
[2022-05-15 21:20:30] [INFO ] Implicit Places using invariants in 1356 ms returned []
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:20:30] [INFO ] Invariants computation overflowed in 69 ms
[2022-05-15 21:20:32] [INFO ] Implicit Places using invariants and state equation in 2300 ms returned []
Implicit Place search using SMT with State Equation took 3663 ms to find 0 implicit places.
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:20:32] [INFO ] Invariants computation overflowed in 51 ms
[2022-05-15 21:20:34] [INFO ] Dead Transitions using invariants and state equation in 1311 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2801/2801 places, 2696/2696 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8874 edges and 2801 vertex of which 2799 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT p1)), (X (X p2)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 1373 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 88836 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88836 steps, saw 44424 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:20:37] [INFO ] Invariants computation overflowed in 49 ms
[2022-05-15 21:21:02] [INFO ] After 25013ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 2801 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2801/2801 places, 2696/2696 transitions.
Graph (complete) has 8474 edges and 2801 vertex of which 2799 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2799 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2799 transition count 2693
Deduced a syphon composed of 1 places in 49 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2798 transition count 2693
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2798 transition count 2297
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1196 place count 2402 transition count 2297
Applied a total of 1196 rules in 691 ms. Remains 2402 /2801 variables (removed 399) and now considering 2297/2696 (removed 399) transitions.
Finished structural reductions, in 1 iterations. Remains : 2402/2801 places, 2297/2696 transitions.
Incomplete random walk after 10000 steps, including 1262 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 823 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 105744 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105744 steps, saw 52925 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2297 rows 2402 cols
[2022-05-15 21:21:06] [INFO ] Invariants computation overflowed in 62 ms
[2022-05-15 21:21:31] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 2402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 205 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2402/2402 places, 2297/2297 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 217 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2402 cols
[2022-05-15 21:21:32] [INFO ] Invariants computation overflowed in 60 ms
[2022-05-15 21:21:54] [INFO ] Implicit Places using invariants in 21996 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2022-05-15 21:21:54] [INFO ] Invariants computation overflowed in 61 ms
[2022-05-15 21:22:17] [INFO ] Implicit Places using invariants and state equation in 23073 ms returned []
Implicit Place search using SMT with State Equation took 45080 ms to find 0 implicit places.
[2022-05-15 21:22:17] [INFO ] Redundant transitions in 96 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2022-05-15 21:22:17] [INFO ] Invariants computation overflowed in 59 ms
[2022-05-15 21:22:19] [INFO ] Dead Transitions using invariants and state equation in 1580 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2402/2402 places, 2297/2297 transitions.
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT p1)), (X (X p2)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 224 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 88 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 82 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 13866 reset in 185 ms.
Product exploration explored 100000 steps with 13793 reset in 191 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 98 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Support contains 3 out of 2801 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2801/2801 places, 2696/2696 transitions.
Applied a total of 0 rules in 163 ms. Remains 2801 /2801 variables (removed 0) and now considering 2696/2696 (removed 0) transitions.
[2022-05-15 21:22:20] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:22:20] [INFO ] Invariants computation overflowed in 52 ms
[2022-05-15 21:22:21] [INFO ] Dead Transitions using invariants and state equation in 1327 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2801/2801 places, 2696/2696 transitions.
Product exploration explored 100000 steps with 13868 reset in 256 ms.
Product exploration explored 100000 steps with 13847 reset in 268 ms.
Built C files in :
/tmp/ltsmin13751731836380989781
[2022-05-15 21:22:22] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13751731836380989781
Running compilation step : cd /tmp/ltsmin13751731836380989781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13751731836380989781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13751731836380989781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 2801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2801/2801 places, 2696/2696 transitions.
Applied a total of 0 rules in 145 ms. Remains 2801 /2801 variables (removed 0) and now considering 2696/2696 (removed 0) transitions.
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:22:25] [INFO ] Invariants computation overflowed in 65 ms
[2022-05-15 21:22:26] [INFO ] Implicit Places using invariants in 1381 ms returned []
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:22:26] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-15 21:22:29] [INFO ] Implicit Places using invariants and state equation in 2278 ms returned []
Implicit Place search using SMT with State Equation took 3662 ms to find 0 implicit places.
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:22:29] [INFO ] Invariants computation overflowed in 52 ms
[2022-05-15 21:22:30] [INFO ] Dead Transitions using invariants and state equation in 1292 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2801/2801 places, 2696/2696 transitions.
Built C files in :
/tmp/ltsmin16684588469081711059
[2022-05-15 21:22:30] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16684588469081711059
Running compilation step : cd /tmp/ltsmin16684588469081711059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16684588469081711059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16684588469081711059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:22:33] [INFO ] Flatten gal took : 133 ms
[2022-05-15 21:22:34] [INFO ] Flatten gal took : 102 ms
[2022-05-15 21:22:34] [INFO ] Time to serialize gal into /tmp/LTL6641056775567403355.gal : 8 ms
[2022-05-15 21:22:34] [INFO ] Time to serialize properties into /tmp/LTL10669721872861313586.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6641056775567403355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10669721872861313586.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6641056...267
Read 1 LTL properties
Checking formula 0 : !((G((!(((G("(p2565>=1)"))U("(p3166>=1)"))U("(p3166>=1)")))||(G(X(G("((p2565<1)&&(p412<1))")))))))
Formula 0 simplified : !G(!((G"(p2565>=1)" U "(p3166>=1)") U "(p3166>=1)") | GXG"((p2565<1)&&(p412<1))")
Detected timeout of ITS tools.
[2022-05-15 21:22:49] [INFO ] Flatten gal took : 83 ms
[2022-05-15 21:22:49] [INFO ] Applying decomposition
[2022-05-15 21:22:49] [INFO ] Flatten gal took : 90 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18362642157663534695.txt' '-o' '/tmp/graph18362642157663534695.bin' '-w' '/tmp/graph18362642157663534695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18362642157663534695.bin' '-l' '-1' '-v' '-w' '/tmp/graph18362642157663534695.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:22:49] [INFO ] Decomposing Gal with order
[2022-05-15 21:22:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:22:49] [INFO ] Removed a total of 2118 redundant transitions.
[2022-05-15 21:22:49] [INFO ] Flatten gal took : 181 ms
[2022-05-15 21:22:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 122 ms.
[2022-05-15 21:22:50] [INFO ] Time to serialize gal into /tmp/LTL7247082810983223135.gal : 92 ms
[2022-05-15 21:22:50] [INFO ] Time to serialize properties into /tmp/LTL10149525423904874357.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7247082810983223135.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10149525423904874357.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7247082...246
Read 1 LTL properties
Checking formula 0 : !((G((!(((G("(i6.u355.p2565>=1)"))U("(i9.i0.i1.u487.p3166>=1)"))U("(i9.i0.i1.u487.p3166>=1)")))||(G(X(G("((i6.u355.p2565<1)&&(i16.u689...172
Formula 0 simplified : !G(!((G"(i6.u355.p2565>=1)" U "(i9.i0.i1.u487.p3166>=1)") U "(i9.i0.i1.u487.p3166>=1)") | GXG"((i6.u355.p2565<1)&&(i16.u689.p412<1))...157
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2685219013381772994
[2022-05-15 21:23:05] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2685219013381772994
Running compilation step : cd /tmp/ltsmin2685219013381772994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2685219013381772994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2685219013381772994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleExponent-PT-100-LTLFireability-14 finished in 278809 ms.
[2022-05-15 21:23:08] [INFO ] Flatten gal took : 126 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2200283330605436139
[2022-05-15 21:23:08] [INFO ] Too many transitions (4998) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:23:08] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2200283330605436139
Running compilation step : cd /tmp/ltsmin2200283330605436139;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 21:23:08] [INFO ] Applying decomposition
[2022-05-15 21:23:08] [INFO ] Flatten gal took : 129 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10907359568327004125.txt' '-o' '/tmp/graph10907359568327004125.bin' '-w' '/tmp/graph10907359568327004125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10907359568327004125.bin' '-l' '-1' '-v' '-w' '/tmp/graph10907359568327004125.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:23:09] [INFO ] Decomposing Gal with order
[2022-05-15 21:23:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:23:10] [INFO ] Removed a total of 1424 redundant transitions.
[2022-05-15 21:23:10] [INFO ] Flatten gal took : 231 ms
[2022-05-15 21:23:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 76 ms.
[2022-05-15 21:23:10] [INFO ] Time to serialize gal into /tmp/LTLFireability887187168619425778.gal : 39 ms
[2022-05-15 21:23:10] [INFO ] Time to serialize properties into /tmp/LTLFireability10757203958680555279.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability887187168619425778.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10757203958680555279.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !((X(X(X(!((("(i0.u38.p1081>=1)")U(X("(i2.u207.p1480>=1)")))U("(i2.u217.p1457>=1)")))))))
Formula 0 simplified : !XXX!(("(i0.u38.p1081>=1)" U X"(i2.u207.p1480>=1)") U "(i2.u217.p1457>=1)")
Compilation finished in 19206 ms.
Running link step : cd /tmp/ltsmin2200283330605436139;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin2200283330605436139;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(!(((LTLAPp0==true) U X((LTLAPp1==true))) U (LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 2116 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2200283330605436139;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((!(([]((LTLAPp3==true)) U (LTLAPp4==true)) U (LTLAPp4==true))||[](X([]((LTLAPp5==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 21:49:45] [INFO ] Flatten gal took : 404 ms
[2022-05-15 21:49:45] [INFO ] Time to serialize gal into /tmp/LTLFireability9829724508453504026.gal : 36 ms
[2022-05-15 21:49:45] [INFO ] Time to serialize properties into /tmp/LTLFireability5175627753673244997.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9829724508453504026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5175627753673244997.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((G((!(((G("(p2565>=1)"))U("(p3166>=1)"))U("(p3166>=1)")))||(G(X(G("((p2565<1)&&(p412<1))")))))))
Formula 0 simplified : !G(!((G"(p2565>=1)" U "(p3166>=1)") U "(p3166>=1)") | GXG"((p2565<1)&&(p412<1))")
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin2200283330605436139;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((!(([]((LTLAPp3==true)) U (LTLAPp4==true)) U (LTLAPp4==true))||[](X([]((LTLAPp5==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin2200283330605436139;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((!(([]((LTLAPp3==true)) U (LTLAPp4==true)) U (LTLAPp4==true))||[](X([]((LTLAPp5==true))))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-100, 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 r078-tall-165260110000212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 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 ;