About the Execution of LoLa+red for Philosophers-COL-001000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11963.968 | 762679.00 | 863478.00 | 2591.20 | TFT?FF?FFFTFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r295-tall-167873947500139.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Philosophers-COL-001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947500139
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.7K Feb 25 14:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 25 14:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 13:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 52K Mar 5 18:23 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 Philosophers-COL-001000-LTLCardinality-00
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-01
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-02
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-03
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-04
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-05
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-06
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-07
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-08
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-09
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-10
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-11
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-12
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-13
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-14
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678786527043
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-001000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 09:35:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 09:35:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:35:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 09:35:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 09:35:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 644 ms
[2023-03-14 09:35:29] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 5000 PT places and 5000.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 09:35:29] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2023-03-14 09:35:29] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-COL-001000-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10019 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=589 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 09:35:29] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-14 09:35:29] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 09:35:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 09:35:29] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Philosophers-COL-001000-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 09:35:29] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:35:29] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 1000) 1000) 1000)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 09:35:29] [INFO ] Unfolded HLPN to a Petri net with 5000 places and 5000 transitions 16000 arcs in 74 ms.
[2023-03-14 09:35:29] [INFO ] Unfolded 11 HLPN properties in 5 ms.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 86 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 09:35:30] [INFO ] Computed 2000 place invariants in 37 ms
[2023-03-14 09:35:30] [INFO ] Implicit Places using invariants in 678 ms returned []
[2023-03-14 09:35:30] [INFO ] Invariant cache hit.
[2023-03-14 09:35:31] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2023-03-14 09:35:31] [INFO ] Invariant cache hit.
[2023-03-14 09:35:34] [INFO ] Dead Transitions using invariants and state equation in 3167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4478 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 5000 out of 5000 places after structural reductions.
[2023-03-14 09:35:34] [INFO ] Flatten gal took : 331 ms
[2023-03-14 09:35:35] [INFO ] Flatten gal took : 216 ms
[2023-03-14 09:35:36] [INFO ] Input system was already deterministic with 5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3405 ms. (steps per millisecond=2 ) properties (out of 17) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 845 ms. (steps per millisecond=11 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 978 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 668 ms. (steps per millisecond=14 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 09:35:42] [INFO ] Invariant cache hit.
[2023-03-14 09:35:43] [INFO ] [Real]Absence check using 2000 positive place invariants in 538 ms returned sat
[2023-03-14 09:35:50] [INFO ] After 7796ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 09:35:51] [INFO ] [Nat]Absence check using 2000 positive place invariants in 466 ms returned sat
[2023-03-14 09:35:55] [INFO ] After 3304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 09:35:56] [INFO ] After 3986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 319 ms.
[2023-03-14 09:35:56] [INFO ] After 6324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 2 properties in 247 ms. (steps per millisecond=4 )
Parikh walk visited 2 properties in 250 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X((F(p1)||G(p2)))))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 99 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:35:57] [INFO ] Invariant cache hit.
[2023-03-14 09:35:58] [INFO ] Implicit Places using invariants in 1024 ms returned []
[2023-03-14 09:35:58] [INFO ] Invariant cache hit.
[2023-03-14 09:35:59] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 2055 ms to find 0 implicit places.
[2023-03-14 09:35:59] [INFO ] Invariant cache hit.
[2023-03-14 09:36:02] [INFO ] Dead Transitions using invariants and state equation in 2881 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5038 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 303 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(LEQ (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s40...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-01 finished in 5441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&F(p1)))||(F(p1)&&F((G(p2)||G(!p1))))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 204 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:36:03] [INFO ] Invariant cache hit.
[2023-03-14 09:36:04] [INFO ] Implicit Places using invariants in 1192 ms returned []
[2023-03-14 09:36:04] [INFO ] Invariant cache hit.
[2023-03-14 09:36:05] [INFO ] Implicit Places using invariants and state equation in 1241 ms returned []
Implicit Place search using SMT with State Equation took 2441 ms to find 0 implicit places.
[2023-03-14 09:36:05] [INFO ] Redundant transitions in 354 ms returned []
[2023-03-14 09:36:05] [INFO ] Invariant cache hit.
[2023-03-14 09:36:09] [INFO ] Dead Transitions using invariants and state equation in 3052 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6062 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 74690 steps with 1 reset in 10001 ms.
Product exploration timeout after 69690 steps with 1 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 5 factoid took 319 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1994 ms. (steps per millisecond=5 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1033 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 09:36:33] [INFO ] Invariant cache hit.
[2023-03-14 09:36:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 480 ms returned sat
[2023-03-14 09:36:38] [INFO ] After 2926ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 09:36:38] [INFO ] After 3280ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-14 09:36:38] [INFO ] After 5183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 201 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 203 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F p1), (F (AND p1 p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 407 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
[2023-03-14 09:36:39] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 40 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:36:54] [INFO ] Invariant cache hit.
[2023-03-14 09:36:56] [INFO ] Implicit Places using invariants in 1131 ms returned []
[2023-03-14 09:36:56] [INFO ] Invariant cache hit.
[2023-03-14 09:36:57] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 2255 ms to find 0 implicit places.
[2023-03-14 09:36:57] [INFO ] Invariant cache hit.
[2023-03-14 09:37:00] [INFO ] Dead Transitions using invariants and state equation in 3057 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5352 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2049 ms. (steps per millisecond=4 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1037 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 09:37:03] [INFO ] Invariant cache hit.
[2023-03-14 09:37:04] [INFO ] [Real]Absence check using 2000 positive place invariants in 449 ms returned sat
[2023-03-14 09:37:08] [INFO ] After 2825ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 09:37:08] [INFO ] After 3172ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-14 09:37:09] [INFO ] After 5002ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 187 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 190 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F p1), (F (AND p1 p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 3 factoid took 238 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
[2023-03-14 09:37:10] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Product exploration timeout after 72900 steps with 1 reset in 10001 ms.
Product exploration timeout after 68820 steps with 0 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 211 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:37:46] [INFO ] Redundant transitions in 324 ms returned []
[2023-03-14 09:37:46] [INFO ] Invariant cache hit.
[2023-03-14 09:37:49] [INFO ] Dead Transitions using invariants and state equation in 2920 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3477 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 104 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:37:49] [INFO ] Invariant cache hit.
[2023-03-14 09:37:50] [INFO ] Implicit Places using invariants in 1114 ms returned []
[2023-03-14 09:37:50] [INFO ] Invariant cache hit.
[2023-03-14 09:37:51] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
[2023-03-14 09:37:51] [INFO ] Invariant cache hit.
[2023-03-14 09:37:54] [INFO ] Dead Transitions using invariants and state equation in 2931 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5244 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLCardinality-03 finished in 111992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 480 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:37:55] [INFO ] Invariant cache hit.
[2023-03-14 09:37:57] [INFO ] Implicit Places using invariants in 2169 ms returned []
[2023-03-14 09:37:57] [INFO ] Invariant cache hit.
[2023-03-14 09:37:59] [INFO ] Implicit Places using invariants and state equation in 2201 ms returned []
Implicit Place search using SMT with State Equation took 4371 ms to find 0 implicit places.
[2023-03-14 09:38:00] [INFO ] Redundant transitions in 217 ms returned []
[2023-03-14 09:38:00] [INFO ] Invariant cache hit.
[2023-03-14 09:38:03] [INFO ] Dead Transitions using invariants and state equation in 3083 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8159 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], 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]]
Product exploration explored 100000 steps with 0 reset in 5299 ms.
Stack based approach found an accepted trace after 11708 steps with 0 reset with depth 11709 and stack size 1961 in 1159 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-05 finished in 14679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(G(!p2))))))'
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 43 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:38:09] [INFO ] Invariant cache hit.
[2023-03-14 09:38:10] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-14 09:38:10] [INFO ] Invariant cache hit.
[2023-03-14 09:38:10] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2023-03-14 09:38:10] [INFO ] Redundant transitions in 212 ms returned []
[2023-03-14 09:38:10] [INFO ] Invariant cache hit.
[2023-03-14 09:38:13] [INFO ] Dead Transitions using invariants and state equation in 3063 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4216 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LEQ (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 33760 steps with 0 reset in 10002 ms.
Product exploration timeout after 32630 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2)]
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2971 ms. (steps per millisecond=3 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1818 ms. (steps per millisecond=5 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2320 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 09:38:42] [INFO ] Invariant cache hit.
[2023-03-14 09:38:44] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 09:38:45] [INFO ] [Nat]Absence check using 2000 positive place invariants in 475 ms returned sat
[2023-03-14 09:38:50] [INFO ] After 4199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 09:38:51] [INFO ] After 5000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 440 ms.
[2023-03-14 09:38:51] [INFO ] After 7297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 163 ms. (steps per millisecond=6 )
Parikh walk visited 2 properties in 547 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (F p2), (F p1), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 372 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 35 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:38:52] [INFO ] Invariant cache hit.
[2023-03-14 09:38:53] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-14 09:38:53] [INFO ] Invariant cache hit.
[2023-03-14 09:38:53] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
[2023-03-14 09:38:54] [INFO ] Redundant transitions in 219 ms returned []
[2023-03-14 09:38:54] [INFO ] Invariant cache hit.
[2023-03-14 09:38:57] [INFO ] Dead Transitions using invariants and state equation in 3143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4322 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2)]
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2777 ms. (steps per millisecond=3 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1817 ms. (steps per millisecond=5 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2328 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 784 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 09:39:06] [INFO ] Invariant cache hit.
[2023-03-14 09:39:07] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 09:39:08] [INFO ] [Nat]Absence check using 2000 positive place invariants in 470 ms returned sat
[2023-03-14 09:39:13] [INFO ] After 4147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 09:39:14] [INFO ] After 4883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 402 ms.
[2023-03-14 09:39:14] [INFO ] After 7112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 168 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 521 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (F p2), (F p1), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 293 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Product exploration timeout after 28470 steps with 0 reset in 10003 ms.
Product exploration timeout after 27910 steps with 0 reset in 10001 ms.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 27 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:39:35] [INFO ] Invariant cache hit.
[2023-03-14 09:39:36] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-14 09:39:36] [INFO ] Invariant cache hit.
[2023-03-14 09:39:36] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2023-03-14 09:39:36] [INFO ] Redundant transitions in 217 ms returned []
[2023-03-14 09:39:36] [INFO ] Invariant cache hit.
[2023-03-14 09:39:40] [INFO ] Dead Transitions using invariants and state equation in 3070 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4230 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLCardinality-06 finished in 90689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 151 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:39:40] [INFO ] Invariant cache hit.
[2023-03-14 09:39:43] [INFO ] Implicit Places using invariants in 2772 ms returned []
[2023-03-14 09:39:43] [INFO ] Invariant cache hit.
[2023-03-14 09:39:45] [INFO ] Implicit Places using invariants and state equation in 2732 ms returned []
Implicit Place search using SMT with State Equation took 5505 ms to find 0 implicit places.
[2023-03-14 09:39:45] [INFO ] Invariant cache hit.
[2023-03-14 09:39:48] [INFO ] Dead Transitions using invariants and state equation in 2885 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8542 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-07 finished in 8662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(!p2)))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 50 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:39:49] [INFO ] Invariant cache hit.
[2023-03-14 09:39:50] [INFO ] Implicit Places using invariants in 1034 ms returned []
[2023-03-14 09:39:50] [INFO ] Invariant cache hit.
[2023-03-14 09:39:51] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 2052 ms to find 0 implicit places.
[2023-03-14 09:39:51] [INFO ] Redundant transitions in 216 ms returned []
[2023-03-14 09:39:51] [INFO ] Invariant cache hit.
[2023-03-14 09:39:54] [INFO ] Dead Transitions using invariants and state equation in 3101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5426 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), p2, (AND (NOT p1) p2)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(LEQ (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 73 steps with 0 reset in 37 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-08 finished in 5602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 71 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:39:54] [INFO ] Invariant cache hit.
[2023-03-14 09:39:55] [INFO ] Implicit Places using invariants in 1090 ms returned []
[2023-03-14 09:39:55] [INFO ] Invariant cache hit.
[2023-03-14 09:39:56] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 2195 ms to find 0 implicit places.
[2023-03-14 09:39:57] [INFO ] Redundant transitions in 213 ms returned []
[2023-03-14 09:39:57] [INFO ] Invariant cache hit.
[2023-03-14 09:40:00] [INFO ] Dead Transitions using invariants and state equation in 3059 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5552 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s40...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 41040 steps with 29 reset in 10003 ms.
Product exploration timeout after 39700 steps with 27 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1826 ms. (steps per millisecond=5 ) properties (out of 2) seen :1
Finished Best-First random walk after 4000 steps, including 0 resets, run visited all 1 properties in 295 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-14 09:40:24] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 91 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:40:39] [INFO ] Invariant cache hit.
[2023-03-14 09:40:40] [INFO ] Implicit Places using invariants in 1118 ms returned []
[2023-03-14 09:40:40] [INFO ] Invariant cache hit.
[2023-03-14 09:40:41] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 2218 ms to find 0 implicit places.
[2023-03-14 09:40:41] [INFO ] Redundant transitions in 217 ms returned []
[2023-03-14 09:40:41] [INFO ] Invariant cache hit.
[2023-03-14 09:40:45] [INFO ] Dead Transitions using invariants and state equation in 3112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5650 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1794 ms. (steps per millisecond=5 ) properties (out of 2) seen :1
Finished Best-First random walk after 4000 steps, including 0 resets, run visited all 1 properties in 295 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-14 09:40:49] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 40350 steps with 28 reset in 10003 ms.
Product exploration timeout after 39130 steps with 28 reset in 10001 ms.
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 67 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:41:24] [INFO ] Invariant cache hit.
[2023-03-14 09:41:25] [INFO ] Implicit Places using invariants in 1147 ms returned []
[2023-03-14 09:41:25] [INFO ] Invariant cache hit.
[2023-03-14 09:41:26] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 2279 ms to find 0 implicit places.
[2023-03-14 09:41:26] [INFO ] Redundant transitions in 231 ms returned []
[2023-03-14 09:41:26] [INFO ] Invariant cache hit.
[2023-03-14 09:41:29] [INFO ] Dead Transitions using invariants and state equation in 3069 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5658 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLCardinality-11 finished in 95600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0&&F(p1))))||F((!p1&&X(p2)))))'
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 60 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:41:30] [INFO ] Invariant cache hit.
[2023-03-14 09:41:31] [INFO ] Implicit Places using invariants in 1628 ms returned []
[2023-03-14 09:41:31] [INFO ] Invariant cache hit.
[2023-03-14 09:41:33] [INFO ] Implicit Places using invariants and state equation in 1627 ms returned []
Implicit Place search using SMT with State Equation took 3256 ms to find 0 implicit places.
[2023-03-14 09:41:33] [INFO ] Invariant cache hit.
[2023-03-14 09:41:36] [INFO ] Dead Transitions using invariants and state equation in 3113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6430 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 3 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 36960 steps with 24 reset in 10001 ms.
Product exploration timeout after 35530 steps with 26 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2) p0)), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 381 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2149 ms. (steps per millisecond=4 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1427 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 664 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 09:42:02] [INFO ] Invariant cache hit.
[2023-03-14 09:42:04] [INFO ] [Real]Absence check using 2000 positive place invariants in 471 ms returned sat
[2023-03-14 09:42:04] [INFO ] After 1244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 09:42:05] [INFO ] [Nat]Absence check using 2000 positive place invariants in 461 ms returned sat
[2023-03-14 09:42:08] [INFO ] After 3128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 09:42:09] [INFO ] After 3754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 327 ms.
[2023-03-14 09:42:09] [INFO ] After 5319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 719 steps, including 0 resets, run visited all 2 properties in 114 ms. (steps per millisecond=6 )
Parikh walk visited 2 properties in 115 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2) p0)), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 9 factoid took 727 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 56 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:42:11] [INFO ] Invariant cache hit.
[2023-03-14 09:42:13] [INFO ] Implicit Places using invariants in 1708 ms returned []
[2023-03-14 09:42:13] [INFO ] Invariant cache hit.
[2023-03-14 09:42:14] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 3322 ms to find 0 implicit places.
[2023-03-14 09:42:14] [INFO ] Invariant cache hit.
[2023-03-14 09:42:17] [INFO ] Dead Transitions using invariants and state equation in 3161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6541 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 301 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2637 ms. (steps per millisecond=3 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1379 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 691 ms. (steps per millisecond=14 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 09:42:23] [INFO ] Invariant cache hit.
[2023-03-14 09:42:25] [INFO ] [Real]Absence check using 2000 positive place invariants in 459 ms returned sat
[2023-03-14 09:42:25] [INFO ] After 1221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 09:42:26] [INFO ] [Nat]Absence check using 2000 positive place invariants in 462 ms returned sat
[2023-03-14 09:42:29] [INFO ] After 3090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 09:42:30] [INFO ] After 3711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 315 ms.
[2023-03-14 09:42:30] [INFO ] After 5254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 730 steps, including 0 resets, run visited all 2 properties in 187 ms. (steps per millisecond=3 )
Parikh walk visited 2 properties in 188 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p2) p0 p1))), (F (NOT p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 5 factoid took 467 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration timeout after 28850 steps with 19 reset in 10002 ms.
Product exploration timeout after 31670 steps with 21 reset in 10002 ms.
Applying partial POR strategy [false, false, false, false, false, true]
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 75 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:42:52] [INFO ] Redundant transitions in 215 ms returned []
[2023-03-14 09:42:52] [INFO ] Invariant cache hit.
[2023-03-14 09:42:55] [INFO ] Dead Transitions using invariants and state equation in 2965 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3271 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 57 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:42:55] [INFO ] Invariant cache hit.
[2023-03-14 09:42:57] [INFO ] Implicit Places using invariants in 1614 ms returned []
[2023-03-14 09:42:57] [INFO ] Invariant cache hit.
[2023-03-14 09:42:58] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned []
Implicit Place search using SMT with State Equation took 3205 ms to find 0 implicit places.
[2023-03-14 09:42:58] [INFO ] Invariant cache hit.
[2023-03-14 09:43:01] [INFO ] Dead Transitions using invariants and state equation in 3079 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6342 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLCardinality-12 finished in 91981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 160 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:43:02] [INFO ] Invariant cache hit.
[2023-03-14 09:43:04] [INFO ] Implicit Places using invariants in 2211 ms returned []
[2023-03-14 09:43:04] [INFO ] Invariant cache hit.
[2023-03-14 09:43:06] [INFO ] Implicit Places using invariants and state equation in 2191 ms returned []
Implicit Place search using SMT with State Equation took 4403 ms to find 0 implicit places.
[2023-03-14 09:43:06] [INFO ] Redundant transitions in 220 ms returned []
[2023-03-14 09:43:06] [INFO ] Invariant cache hit.
[2023-03-14 09:43:10] [INFO ] Dead Transitions using invariants and state equation in 3132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7921 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 52270 steps with 0 reset in 10002 ms.
Product exploration timeout after 51100 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 72 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-14 09:43:32] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 179 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:43:47] [INFO ] Invariant cache hit.
[2023-03-14 09:43:50] [INFO ] Implicit Places using invariants in 2152 ms returned []
[2023-03-14 09:43:50] [INFO ] Invariant cache hit.
[2023-03-14 09:43:52] [INFO ] Implicit Places using invariants and state equation in 2039 ms returned []
Implicit Place search using SMT with State Equation took 4194 ms to find 0 implicit places.
[2023-03-14 09:43:52] [INFO ] Redundant transitions in 219 ms returned []
[2023-03-14 09:43:52] [INFO ] Invariant cache hit.
[2023-03-14 09:43:55] [INFO ] Dead Transitions using invariants and state equation in 2966 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7568 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-14 09:43:57] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration timeout after 51820 steps with 0 reset in 10001 ms.
Product exploration timeout after 50470 steps with 0 reset in 10002 ms.
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 177 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:44:33] [INFO ] Invariant cache hit.
[2023-03-14 09:44:35] [INFO ] Implicit Places using invariants in 2028 ms returned []
[2023-03-14 09:44:35] [INFO ] Invariant cache hit.
[2023-03-14 09:44:37] [INFO ] Implicit Places using invariants and state equation in 2183 ms returned []
Implicit Place search using SMT with State Equation took 4216 ms to find 0 implicit places.
[2023-03-14 09:44:37] [INFO ] Redundant transitions in 223 ms returned []
[2023-03-14 09:44:37] [INFO ] Invariant cache hit.
[2023-03-14 09:44:40] [INFO ] Dead Transitions using invariants and state equation in 3130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7765 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLCardinality-13 finished in 98823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 1000 Post agglomeration using F-continuation condition.Transition count delta: 1000
Deduced a syphon composed of 1000 places in 1 ms
Reduce places removed 1000 places and 0 transitions.
Iterating global reduction 0 with 2000 rules applied. Total rules applied 2000 place count 4000 transition count 4000
Applied a total of 2000 rules in 587 ms. Remains 4000 /5000 variables (removed 1000) and now considering 4000/5000 (removed 1000) transitions.
// Phase 1: matrix 4000 rows 4000 cols
[2023-03-14 09:44:41] [INFO ] Computed 2000 place invariants in 11 ms
[2023-03-14 09:44:43] [INFO ] Implicit Places using invariants in 2035 ms returned []
[2023-03-14 09:44:43] [INFO ] Invariant cache hit.
[2023-03-14 09:44:52] [INFO ] Implicit Places using invariants and state equation in 8837 ms returned []
Implicit Place search using SMT with State Equation took 10874 ms to find 0 implicit places.
[2023-03-14 09:44:52] [INFO ] Redundant transitions in 149 ms returned []
[2023-03-14 09:44:52] [INFO ] Invariant cache hit.
[2023-03-14 09:44:55] [INFO ] Dead Transitions using invariants and state equation in 3278 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4000/5000 places, 4000/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14899 ms. Remains : 4000/5000 places, 4000/5000 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2...], 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]]
Product exploration timeout after 37940 steps with 5402 reset in 10001 ms.
Stack based approach found an accepted trace after 2628 steps with 379 reset with depth 2 and stack size 2 in 699 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-15 finished in 25667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&F(p1)))||(F(p1)&&F((G(p2)||G(!p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(G(!p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0&&F(p1))))||F((!p1&&X(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-14 09:45:07] [INFO ] Flatten gal took : 181 ms
[2023-03-14 09:45:07] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 11 ms.
[2023-03-14 09:45:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5000 places, 5000 transitions and 16000 arcs took 19 ms.
Total runtime 578897 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Philosophers-COL-001000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality
FORMULA Philosophers-COL-001000-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-COL-001000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-COL-001000-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678787289722
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 4 (type EXCL) for 3 Philosophers-COL-001000-LTLCardinality-06
lola: time limit : 598 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 0 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 0 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 1/598 1/32 Philosophers-COL-001000-LTLCardinality-06 4807 m, 961 m/sec, 9543 t fired, .
Time elapsed: 11 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 6/598 2/32 Philosophers-COL-001000-LTLCardinality-06 95818 m, 18202 m/sec, 209432 t fired, .
Time elapsed: 16 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 11/598 4/32 Philosophers-COL-001000-LTLCardinality-06 186649 m, 18166 m/sec, 409301 t fired, .
Time elapsed: 21 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 16/598 6/32 Philosophers-COL-001000-LTLCardinality-06 277842 m, 18238 m/sec, 610401 t fired, .
Time elapsed: 26 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 21/598 8/32 Philosophers-COL-001000-LTLCardinality-06 368720 m, 18175 m/sec, 811180 t fired, .
Time elapsed: 31 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 26/598 9/32 Philosophers-COL-001000-LTLCardinality-06 458565 m, 17969 m/sec, 1009943 t fired, .
Time elapsed: 36 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 31/598 11/32 Philosophers-COL-001000-LTLCardinality-06 546178 m, 17522 m/sec, 1203903 t fired, .
Time elapsed: 41 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 36/598 12/32 Philosophers-COL-001000-LTLCardinality-06 633497 m, 17463 m/sec, 1397572 t fired, .
Time elapsed: 46 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 41/598 14/32 Philosophers-COL-001000-LTLCardinality-06 719895 m, 17279 m/sec, 1589502 t fired, .
Time elapsed: 51 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 46/598 16/32 Philosophers-COL-001000-LTLCardinality-06 805036 m, 17028 m/sec, 1779800 t fired, .
Time elapsed: 56 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 51/598 17/32 Philosophers-COL-001000-LTLCardinality-06 888538 m, 16700 m/sec, 1965717 t fired, .
Time elapsed: 61 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 56/598 19/32 Philosophers-COL-001000-LTLCardinality-06 971889 m, 16670 m/sec, 2152528 t fired, .
Time elapsed: 66 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 61/598 20/32 Philosophers-COL-001000-LTLCardinality-06 1055738 m, 16769 m/sec, 2340018 t fired, .
Time elapsed: 71 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 66/598 22/32 Philosophers-COL-001000-LTLCardinality-06 1137241 m, 16300 m/sec, 2523196 t fired, .
Time elapsed: 76 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 71/598 23/32 Philosophers-COL-001000-LTLCardinality-06 1217977 m, 16147 m/sec, 2704906 t fired, .
Time elapsed: 81 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 76/598 25/32 Philosophers-COL-001000-LTLCardinality-06 1297470 m, 15898 m/sec, 2883362 t fired, .
Time elapsed: 86 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 81/598 26/32 Philosophers-COL-001000-LTLCardinality-06 1376652 m, 15836 m/sec, 3062130 t fired, .
Time elapsed: 91 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 86/598 27/32 Philosophers-COL-001000-LTLCardinality-06 1456733 m, 16016 m/sec, 3243322 t fired, .
Time elapsed: 96 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 91/598 29/32 Philosophers-COL-001000-LTLCardinality-06 1535792 m, 15811 m/sec, 3422450 t fired, .
Time elapsed: 101 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 96/598 30/32 Philosophers-COL-001000-LTLCardinality-06 1613185 m, 15478 m/sec, 3598017 t fired, .
Time elapsed: 106 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 101/598 31/32 Philosophers-COL-001000-LTLCardinality-06 1689367 m, 15236 m/sec, 3771087 t fired, .
Time elapsed: 111 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 4 (type EXCL) for Philosophers-COL-001000-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
Philosophers-COL-001000-LTLCardinality-11: CONJ 0 2 0 0 2 0 0 0
Philosophers-COL-001000-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 14 (type EXCL) for 13 Philosophers-COL-001000-LTLCardinality-12
lola: time limit : 696 sec
lola: memory limit: 32 pages
lola: FINISHED task # 14 (type EXCL) for Philosophers-COL-001000-LTLCardinality-12
lola: result : false
lola: markings : 1002
lola: fired transitions : 1002
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 17 (type EXCL) for 16 Philosophers-COL-001000-LTLCardinality-13
lola: time limit : 871 sec
lola: memory limit: 32 pages
lola: FINISHED task # 17 (type EXCL) for Philosophers-COL-001000-LTLCardinality-13
lola: result : false
lola: markings : 1003
lola: fired transitions : 1004
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 11 (type EXCL) for 6 Philosophers-COL-001000-LTLCardinality-11
lola: time limit : 1161 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for Philosophers-COL-001000-LTLCardinality-11
lola: result : false
lola: markings : 1752
lola: fired transitions : 1752
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 Philosophers-COL-001000-LTLCardinality-03
lola: time limit : 3484 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3484 4/32 Philosophers-COL-001000-LTLCardinality-03 137180 m, 27436 m/sec, 137180 t fired, .
Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3484 7/32 Philosophers-COL-001000-LTLCardinality-03 274908 m, 27545 m/sec, 275067 t fired, .
Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3484 9/32 Philosophers-COL-001000-LTLCardinality-03 417656 m, 28549 m/sec, 418325 t fired, .
Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3484 12/32 Philosophers-COL-001000-LTLCardinality-03 559330 m, 28334 m/sec, 560628 t fired, .
Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3484 14/32 Philosophers-COL-001000-LTLCardinality-03 701728 m, 28479 m/sec, 703684 t fired, .
Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3484 17/32 Philosophers-COL-001000-LTLCardinality-03 846629 m, 28980 m/sec, 849192 t fired, .
Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3484 19/32 Philosophers-COL-001000-LTLCardinality-03 990966 m, 28867 m/sec, 994266 t fired, .
Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3484 22/32 Philosophers-COL-001000-LTLCardinality-03 1136070 m, 29020 m/sec, 1140001 t fired, .
Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3484 25/32 Philosophers-COL-001000-LTLCardinality-03 1282758 m, 29337 m/sec, 1287408 t fired, .
Time elapsed: 161 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3484 27/32 Philosophers-COL-001000-LTLCardinality-03 1427473 m, 28943 m/sec, 1432947 t fired, .
Time elapsed: 166 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3484 30/32 Philosophers-COL-001000-LTLCardinality-03 1571354 m, 28776 m/sec, 1577608 t fired, .
Time elapsed: 171 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3484 32/32 Philosophers-COL-001000-LTLCardinality-03 1715946 m, 28918 m/sec, 1722999 t fired, .
Time elapsed: 176 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 1 (type EXCL) for Philosophers-COL-001000-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-001000-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Philosophers-COL-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 181 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: Portfolio finished: no open tasks 5
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-001000-LTLCardinality-03: LTL unknown AGGR
Philosophers-COL-001000-LTLCardinality-06: LTL unknown AGGR
Philosophers-COL-001000-LTLCardinality-11: CONJ false LTL model checker
Philosophers-COL-001000-LTLCardinality-12: LTL false LTL model checker
Philosophers-COL-001000-LTLCardinality-13: LTL false LTL model checker
Time elapsed: 181 secs. Pages in use: 32
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="Philosophers-COL-001000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Philosophers-COL-001000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873947500139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-001000.tgz
mv Philosophers-COL-001000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;