About the Execution of ITS-Tools for Philosophers-COL-000500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9967.031 | 2955584.00 | 9892686.00 | 2660.60 | FFFFFFFFFFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016400228.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-COL-000500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016400228
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 5.5K Apr 29 12:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 29 12:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 11:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 11:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 31K May 10 09:34 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-000500-LTLFireability-00
FORMULA_NAME Philosophers-COL-000500-LTLFireability-01
FORMULA_NAME Philosophers-COL-000500-LTLFireability-02
FORMULA_NAME Philosophers-COL-000500-LTLFireability-03
FORMULA_NAME Philosophers-COL-000500-LTLFireability-04
FORMULA_NAME Philosophers-COL-000500-LTLFireability-05
FORMULA_NAME Philosophers-COL-000500-LTLFireability-06
FORMULA_NAME Philosophers-COL-000500-LTLFireability-07
FORMULA_NAME Philosophers-COL-000500-LTLFireability-08
FORMULA_NAME Philosophers-COL-000500-LTLFireability-09
FORMULA_NAME Philosophers-COL-000500-LTLFireability-10
FORMULA_NAME Philosophers-COL-000500-LTLFireability-11
FORMULA_NAME Philosophers-COL-000500-LTLFireability-12
FORMULA_NAME Philosophers-COL-000500-LTLFireability-13
FORMULA_NAME Philosophers-COL-000500-LTLFireability-14
FORMULA_NAME Philosophers-COL-000500-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652805965730
Running Version 202205111006
[2022-05-17 16:46:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 16:46:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:46:06] [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.
[2022-05-17 16:46:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 16:46:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 571 ms
[2022-05-17 16:46:07] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 2500 PT places and 2500.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-17 16:46:07] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2022-05-17 16:46:07] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-COL-000500-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10039 steps, including 19 resets, run finished after 16 ms. (steps per millisecond=627 ) properties (out of 2) seen :1
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
[2022-05-17 16:46:07] [INFO ] Flatten gal took : 12 ms
[2022-05-17 16:46:07] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 500) 500) 500)]] contains successor/predecessor on variables of sort Philo
[2022-05-17 16:46:07] [INFO ] Unfolded HLPN to a Petri net with 2500 places and 2500 transitions 8000 arcs in 50 ms.
[2022-05-17 16:46:07] [INFO ] Unfolded 12 HLPN properties in 4 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000500-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 76 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:46:08] [INFO ] Computed 1000 place invariants in 34 ms
[2022-05-17 16:46:09] [INFO ] Implicit Places using invariants in 878 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:46:09] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 16:46:10] [INFO ] Implicit Places using invariants and state equation in 1735 ms returned []
Implicit Place search using SMT with State Equation took 2639 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:46:10] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 16:46:13] [INFO ] Dead Transitions using invariants and state equation in 2622 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2000 out of 2500 places after structural reductions.
[2022-05-17 16:46:14] [INFO ] Flatten gal took : 250 ms
[2022-05-17 16:46:14] [INFO ] Flatten gal took : 241 ms
[2022-05-17 16:46:15] [INFO ] Input system was already deterministic with 2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 873 ms. (steps per millisecond=11 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1029 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1013 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1922 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1578 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:46:22] [INFO ] Computed 1000 place invariants in 13 ms
[2022-05-17 16:46:26] [INFO ] [Real]Absence check using 1000 positive place invariants in 300 ms returned sat
[2022-05-17 16:46:27] [INFO ] After 1427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 16:46:27] [INFO ] [Nat]Absence check using 1000 positive place invariants in 185 ms returned sat
[2022-05-17 16:46:30] [INFO ] After 1914ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 16:46:31] [INFO ] After 2972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 726 ms.
[2022-05-17 16:46:32] [INFO ] After 4728ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 4 properties in 50 ms. (steps per millisecond=10 )
Parikh walk visited 4 properties in 53 ms.
FORMULA Philosophers-COL-000500-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Philosophers-COL-000500-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0 U p1)&&F(G(p0)))) U G(p0)))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 92 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:46:32] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 16:46:33] [INFO ] Implicit Places using invariants in 797 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:46:33] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 16:46:35] [INFO ] Implicit Places using invariants and state equation in 1757 ms returned []
Implicit Place search using SMT with State Equation took 2559 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:46:35] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 16:46:37] [INFO ] Dead Transitions using invariants and state equation in 2567 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), true, (NOT p1), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(OR p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR p0 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s603 1) (GEQ s1604 1)) (AND (GEQ s598 1) (GEQ s1599 1)) (AND (GEQ s894 1) (GEQ s1895 1)) (AND (GEQ s899 1) (GEQ s1900 1)) (AND (GEQ s588 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2556 ms.
Stack based approach found an accepted trace after 24248 steps with 0 reset with depth 24249 and stack size 24227 in 757 ms.
FORMULA Philosophers-COL-000500-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLFireability-02 finished in 8910 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 220 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:46:41] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 16:46:42] [INFO ] Implicit Places using invariants in 1390 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:46:42] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 16:46:45] [INFO ] Implicit Places using invariants and state equation in 2901 ms returned []
Implicit Place search using SMT with State Equation took 4294 ms to find 0 implicit places.
[2022-05-17 16:46:45] [INFO ] Redundant transitions in 138 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:46:45] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 16:46:48] [INFO ] Dead Transitions using invariants and state equation in 2503 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLFireability-03 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 (LT s2211 1) (LT s2471 1) (LT s2276 1) (LT s2406 1) (LT s2341 1) (LT s2000 1) (LT s2130 1) (LT s2065 1) (LT s2162 1) (LT s2227 1) (LT s2487 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2105 ms.
Stack based approach found an accepted trace after 6099 steps with 0 reset with depth 6100 and stack size 6100 in 213 ms.
FORMULA Philosophers-COL-000500-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLFireability-03 finished in 9551 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((!G(p0) U p0)))||G(p0)))'
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 52 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:46:50] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 16:46:52] [INFO ] Implicit Places using invariants in 1400 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:46:52] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:46:55] [INFO ] Implicit Places using invariants and state equation in 3004 ms returned []
Implicit Place search using SMT with State Equation took 4417 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:46:55] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:46:57] [INFO ] Dead Transitions using invariants and state equation in 2620 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s2211 1) (GEQ s2471 1) (GEQ s2276 1) (GEQ s2406 1) (GEQ s2341 1) (GEQ s2000 1) (GEQ s2130 1) (GEQ s2065 1) (GEQ s2162 1) (GEQ s2227 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 70050 steps with 1721 reset in 10001 ms.
Product exploration timeout after 69080 steps with 1683 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 : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:47:31] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 16:47:38] [INFO ] [Real]Absence check using 1000 positive place invariants in 1691 ms returned sat
[2022-05-17 16:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:47:46] [INFO ] [Real]Absence check using state equation in 8046 ms returned unknown
Could not prove EG (NOT p0)
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 70 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:47:46] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 16:47:48] [INFO ] Implicit Places using invariants in 1394 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:47:48] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:47:50] [INFO ] Implicit Places using invariants and state equation in 2881 ms returned []
Implicit Place search using SMT with State Equation took 4278 ms to find 0 implicit places.
[2022-05-17 16:47:51] [INFO ] Redundant transitions in 110 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:47:51] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:47:53] [INFO ] Dead Transitions using invariants and state equation in 2542 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 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 : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:48:07] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 16:48:14] [INFO ] [Real]Absence check using 1000 positive place invariants in 1759 ms returned sat
[2022-05-17 16:48:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:48:22] [INFO ] [Real]Absence check using state equation in 7988 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration timeout after 69220 steps with 1699 reset in 10001 ms.
Product exploration timeout after 67520 steps with 1657 reset in 10002 ms.
Built C files in :
/tmp/ltsmin12834841330167819037
[2022-05-17 16:48:42] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:48:42] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12834841330167819037
Running compilation step : cd /tmp/ltsmin12834841330167819037;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12834841330167819037;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12834841330167819037;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 80 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:48:45] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 16:48:46] [INFO ] Implicit Places using invariants in 1315 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:48:46] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:48:49] [INFO ] Implicit Places using invariants and state equation in 2947 ms returned []
Implicit Place search using SMT with State Equation took 4266 ms to find 0 implicit places.
[2022-05-17 16:48:49] [INFO ] Redundant transitions in 78 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:48:49] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 16:48:52] [INFO ] Dead Transitions using invariants and state equation in 2620 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin16289891492314878033
[2022-05-17 16:48:52] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:48:52] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16289891492314878033
Running compilation step : cd /tmp/ltsmin16289891492314878033;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16289891492314878033;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16289891492314878033;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 16:48:55] [INFO ] Flatten gal took : 101 ms
[2022-05-17 16:48:55] [INFO ] Flatten gal took : 90 ms
[2022-05-17 16:48:55] [INFO ] Time to serialize gal into /tmp/LTL18129177357300099706.gal : 17 ms
[2022-05-17 16:48:55] [INFO ] Time to serialize properties into /tmp/LTL10618999014463310156.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18129177357300099706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10618999014463310156.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1812917...268
Read 1 LTL properties
Checking formula 0 : !(((F(X((!(G("((((((((((Eat_211>=1)||(Eat_471>=1))||((Eat_276>=1)||(Eat_406>=1)))||(((Eat_341>=1)||(Eat_0>=1))||((Eat_130>=1)||(Eat_65...23716
Formula 0 simplified : !(G"((((((((((Eat_211>=1)||(Eat_471>=1))||((Eat_276>=1)||(Eat_406>=1)))||(((Eat_341>=1)||(Eat_0>=1))||((Eat_130>=1)||(Eat_65>=1))))|...23703
Detected timeout of ITS tools.
[2022-05-17 16:49:11] [INFO ] Flatten gal took : 80 ms
[2022-05-17 16:49:11] [INFO ] Applying decomposition
[2022-05-17 16:49:11] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12570198595131933214.txt' '-o' '/tmp/graph12570198595131933214.bin' '-w' '/tmp/graph12570198595131933214.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12570198595131933214.bin' '-l' '-1' '-v' '-w' '/tmp/graph12570198595131933214.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:49:11] [INFO ] Decomposing Gal with order
[2022-05-17 16:49:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:49:11] [INFO ] Removed a total of 497 redundant transitions.
[2022-05-17 16:49:12] [INFO ] Flatten gal took : 296 ms
[2022-05-17 16:49:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1654 labels/synchronizations in 76 ms.
[2022-05-17 16:49:13] [INFO ] Time to serialize gal into /tmp/LTL1357575145937883218.gal : 20 ms
[2022-05-17 16:49:13] [INFO ] Time to serialize properties into /tmp/LTL5893310444701744700.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1357575145937883218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5893310444701744700.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1357575...245
Read 1 LTL properties
Checking formula 0 : !(((F(X((!(G("((((((((((i37.i0.i0.u28.Eat_211>=1)||(i12.i0.i2.u266.Eat_471>=1))||((i39.i0.i0.u289.Eat_276>=1)||(i27.i0.i0.u59.Eat_406>...45019
Formula 0 simplified : !(G"((((((((((i37.i0.i0.u28.Eat_211>=1)||(i12.i0.i2.u266.Eat_471>=1))||((i39.i0.i0.u289.Eat_276>=1)||(i27.i0.i0.u59.Eat_406>=1)))||(...45006
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15335115506118889248
[2022-05-17 16:49:28] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15335115506118889248
Running compilation step : cd /tmp/ltsmin15335115506118889248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15335115506118889248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15335115506118889248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Philosophers-COL-000500-LTLFireability-04 finished in 160320 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 42 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:49:31] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:49:32] [INFO ] Implicit Places using invariants in 918 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:49:32] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 16:49:34] [INFO ] Implicit Places using invariants and state equation in 2170 ms returned []
Implicit Place search using SMT with State Equation took 3090 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:49:34] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 16:49:36] [INFO ] Dead Transitions using invariants and state equation in 2666 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s171 1) (GEQ s670 1)) (AND (GEQ s467 1) (GEQ s966 1)) (AND (GEQ s181 1) (GEQ s680 1)) (AND (GEQ s477 1) (GEQ s976 1)) (AND (GEQ s161 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15781 steps with 0 reset in 445 ms.
FORMULA Philosophers-COL-000500-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000500-LTLFireability-06 finished in 6397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)&&p1))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 35 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:49:37] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:49:38] [INFO ] Implicit Places using invariants in 867 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:49:38] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 16:49:40] [INFO ] Implicit Places using invariants and state equation in 2142 ms returned []
Implicit Place search using SMT with State Equation took 3011 ms to find 0 implicit places.
[2022-05-17 16:49:40] [INFO ] Redundant transitions in 79 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:49:40] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 16:49:43] [INFO ] Dead Transitions using invariants and state equation in 2672 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s603 1) (GEQ s1604 1)) (AND (GEQ s598 1) (GEQ s1599 1)) (AND (GEQ s894 1) (GEQ s1895 1)) (AND (GEQ s899 1) (GEQ s1900 1)) (AND (GEQ s588 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 755 reset in 6961 ms.
Stack based approach found an accepted trace after 32060 steps with 9 reset with depth 31717 and stack size 31679 in 1127 ms.
FORMULA Philosophers-COL-000500-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLFireability-08 finished in 13989 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !(X(p2)||p1)))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 10 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:49:51] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 16:49:52] [INFO ] Implicit Places using invariants in 630 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:49:52] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 16:49:53] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:49:53] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:49:56] [INFO ] Dead Transitions using invariants and state equation in 2653 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (OR p2 p1), p2, p2]
Running random walk in product with property : Philosophers-COL-000500-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 0}], [{ cond=(AND p1 (NOT p0) p2), acceptance={0} source=3 dest: 0}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (GEQ s2211 1) (GEQ s2471 1) (GEQ s2276 1) (GEQ s2406 1) (GEQ s2341 1) (GEQ s2000 1) (GEQ s2130 1) (GEQ s2065 1) (GEQ s2162 1) (GEQ s2227 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000500-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000500-LTLFireability-11 finished in 5158 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 53 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:49:56] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:49:57] [INFO ] Implicit Places using invariants in 865 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:49:57] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 16:49:59] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 2962 ms to find 0 implicit places.
[2022-05-17 16:49:59] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:49:59] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:50:02] [INFO ] Dead Transitions using invariants and state equation in 2673 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s603 1) (GEQ s1604 1)) (AND (GEQ s598 1) (GEQ s1599 1)) (AND (GEQ s894 1) (GEQ s1895 1)) (AND (GEQ s899 1) (GEQ s1900 1)) (AND (GEQ s588 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19 reset in 2232 ms.
Product exploration explored 100000 steps with 14 reset in 2463 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:50:21] [INFO ] Computed 1000 place invariants in 11 ms
Could not prove EG (NOT p0)
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 57 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:50:36] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 16:50:37] [INFO ] Implicit Places using invariants in 844 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:50:37] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:50:39] [INFO ] Implicit Places using invariants and state equation in 2141 ms returned []
Implicit Place search using SMT with State Equation took 2986 ms to find 0 implicit places.
[2022-05-17 16:50:39] [INFO ] Redundant transitions in 78 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:50:39] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:50:42] [INFO ] Dead Transitions using invariants and state equation in 2658 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:50:57] [INFO ] Computed 1000 place invariants in 10 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22 reset in 2335 ms.
Product exploration explored 100000 steps with 13 reset in 2517 ms.
Built C files in :
/tmp/ltsmin3586705480532655323
[2022-05-17 16:51:16] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:51:17] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3586705480532655323
Running compilation step : cd /tmp/ltsmin3586705480532655323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3586705480532655323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3586705480532655323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 59 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:51:20] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:51:20] [INFO ] Implicit Places using invariants in 874 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:51:20] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:51:23] [INFO ] Implicit Places using invariants and state equation in 2078 ms returned []
Implicit Place search using SMT with State Equation took 2953 ms to find 0 implicit places.
[2022-05-17 16:51:23] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:51:23] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 16:51:25] [INFO ] Dead Transitions using invariants and state equation in 2634 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin11677778133041367401
[2022-05-17 16:51:25] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:51:25] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11677778133041367401
Running compilation step : cd /tmp/ltsmin11677778133041367401;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11677778133041367401;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11677778133041367401;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 16:51:29] [INFO ] Flatten gal took : 89 ms
[2022-05-17 16:51:29] [INFO ] Flatten gal took : 74 ms
[2022-05-17 16:51:29] [INFO ] Time to serialize gal into /tmp/LTL16874148312463820417.gal : 9 ms
[2022-05-17 16:51:29] [INFO ] Time to serialize properties into /tmp/LTL4678611756510587747.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16874148312463820417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4678611756510587747.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1687414...267
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((((Fork_103>=1)&&(Catch2_104>=1))||((Fork_98>=1)&&(Catch2_99>=1)))||(((Fork_394>=1)&&(Catch2_395>=1))||((Fork_399>=1)&...17810
Formula 0 simplified : !GF"(((((((((((Fork_103>=1)&&(Catch2_104>=1))||((Fork_98>=1)&&(Catch2_99>=1)))||(((Fork_394>=1)&&(Catch2_395>=1))||((Fork_399>=1)&&(...17804
Detected timeout of ITS tools.
[2022-05-17 16:51:44] [INFO ] Flatten gal took : 69 ms
[2022-05-17 16:51:44] [INFO ] Applying decomposition
[2022-05-17 16:51:44] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1843478557924111136.txt' '-o' '/tmp/graph1843478557924111136.bin' '-w' '/tmp/graph1843478557924111136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1843478557924111136.bin' '-l' '-1' '-v' '-w' '/tmp/graph1843478557924111136.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:51:44] [INFO ] Decomposing Gal with order
[2022-05-17 16:51:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:51:44] [INFO ] Removed a total of 493 redundant transitions.
[2022-05-17 16:51:44] [INFO ] Flatten gal took : 123 ms
[2022-05-17 16:51:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 1106 labels/synchronizations in 18 ms.
[2022-05-17 16:51:44] [INFO ] Time to serialize gal into /tmp/LTL17686137952539160201.gal : 13 ms
[2022-05-17 16:51:44] [INFO ] Time to serialize properties into /tmp/LTL5265384906055614038.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17686137952539160201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5265384906055614038.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1768613...246
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((((i35.u112.Fork_103>=1)&&(i35.u112.Catch2_104>=1))||((i35.u352.Fork_98>=1)&&(i35.u353.Catch2_99>=1)))||(((i28.u56.For...26667
Formula 0 simplified : !GF"(((((((((((i35.u112.Fork_103>=1)&&(i35.u112.Catch2_104>=1))||((i35.u352.Fork_98>=1)&&(i35.u353.Catch2_99>=1)))||(((i28.u56.Fork_...26661
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
659 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.86405,288608,1,0,598087,779,13299,1.24142e+06,387,2328,851495
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000500-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Philosophers-COL-000500-LTLFireability-12 finished in 116567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 42 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:51:53] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 16:51:54] [INFO ] Implicit Places using invariants in 904 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:51:54] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:51:56] [INFO ] Implicit Places using invariants and state equation in 2120 ms returned []
Implicit Place search using SMT with State Equation took 3025 ms to find 0 implicit places.
[2022-05-17 16:51:56] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:51:56] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 16:51:58] [INFO ] Dead Transitions using invariants and state equation in 2584 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s603 1) (GEQ s1604 1)) (AND (GEQ s598 1) (GEQ s1599 1)) (AND (GEQ s894 1) (GEQ s1895 1)) (AND (GEQ s899 1) (GEQ s1900 1)) (AND (GEQ s588 ...], 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 63730 steps with 21202 reset in 10003 ms.
Product exploration timeout after 62350 steps with 20813 reset in 10005 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:52:33] [INFO ] Computed 1000 place invariants in 10 ms
Could not prove EG (NOT p0)
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 38 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:52:48] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 16:52:49] [INFO ] Implicit Places using invariants in 854 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:52:49] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:52:51] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned []
Implicit Place search using SMT with State Equation took 2986 ms to find 0 implicit places.
[2022-05-17 16:52:51] [INFO ] Redundant transitions in 80 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:52:51] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 16:52:54] [INFO ] Dead Transitions using invariants and state equation in 2682 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:53:08] [INFO ] Computed 1000 place invariants in 8 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration timeout after 63780 steps with 21293 reset in 10001 ms.
Product exploration timeout after 61500 steps with 20506 reset in 10002 ms.
Built C files in :
/tmp/ltsmin3592990550472609097
[2022-05-17 16:53:43] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:53:43] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3592990550472609097
Running compilation step : cd /tmp/ltsmin3592990550472609097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3592990550472609097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3592990550472609097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 44 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:53:46] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 16:53:47] [INFO ] Implicit Places using invariants in 980 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:53:47] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:53:49] [INFO ] Implicit Places using invariants and state equation in 2116 ms returned []
Implicit Place search using SMT with State Equation took 3098 ms to find 0 implicit places.
[2022-05-17 16:53:49] [INFO ] Redundant transitions in 79 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:53:49] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 16:53:52] [INFO ] Dead Transitions using invariants and state equation in 2718 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin3221175114412057479
[2022-05-17 16:53:52] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:53:52] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3221175114412057479
Running compilation step : cd /tmp/ltsmin3221175114412057479;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3221175114412057479;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3221175114412057479;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 16:53:55] [INFO ] Flatten gal took : 70 ms
[2022-05-17 16:53:55] [INFO ] Flatten gal took : 71 ms
[2022-05-17 16:53:55] [INFO ] Time to serialize gal into /tmp/LTL623022139211068561.gal : 8 ms
[2022-05-17 16:53:55] [INFO ] Time to serialize properties into /tmp/LTL14001122080035379596.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL623022139211068561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14001122080035379596.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6230221...266
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((((Fork_103>=1)&&(Catch2_104>=1))||((Fork_98>=1)&&(Catch2_99>=1)))||(((Fork_394>=1)&&(Catch2_395>=1))||((Fork_399>=1)&&(...17807
Formula 0 simplified : !F"(((((((((((Fork_103>=1)&&(Catch2_104>=1))||((Fork_98>=1)&&(Catch2_99>=1)))||(((Fork_394>=1)&&(Catch2_395>=1))||((Fork_399>=1)&&(C...17803
Detected timeout of ITS tools.
[2022-05-17 16:54:10] [INFO ] Flatten gal took : 69 ms
[2022-05-17 16:54:10] [INFO ] Applying decomposition
[2022-05-17 16:54:11] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3538196429290768088.txt' '-o' '/tmp/graph3538196429290768088.bin' '-w' '/tmp/graph3538196429290768088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3538196429290768088.bin' '-l' '-1' '-v' '-w' '/tmp/graph3538196429290768088.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:54:11] [INFO ] Decomposing Gal with order
[2022-05-17 16:54:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:54:11] [INFO ] Removed a total of 495 redundant transitions.
[2022-05-17 16:54:11] [INFO ] Flatten gal took : 119 ms
[2022-05-17 16:54:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1682 labels/synchronizations in 23 ms.
[2022-05-17 16:54:12] [INFO ] Time to serialize gal into /tmp/LTL9138825426562234025.gal : 21 ms
[2022-05-17 16:54:12] [INFO ] Time to serialize properties into /tmp/LTL7860822359337201288.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9138825426562234025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7860822359337201288.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9138825...245
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((((i3.i0.i0.u116.Fork_103>=1)&&(i3.i0.i0.u116.Catch2_104>=1))||((i18.i2.i1.u312.Fork_98>=1)&&(i18.i2.i1.u262.Catch2_99>=...32156
Formula 0 simplified : !F"(((((((((((i3.i0.i0.u116.Fork_103>=1)&&(i3.i0.i0.u116.Catch2_104>=1))||((i18.i2.i1.u312.Fork_98>=1)&&(i18.i2.i1.u262.Catch2_99>=1...32152
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8757160662475803867
[2022-05-17 16:54:27] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8757160662475803867
Running compilation step : cd /tmp/ltsmin8757160662475803867;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8757160662475803867;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8757160662475803867;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Philosophers-COL-000500-LTLFireability-13 finished in 156930 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!p0)) U !p1)))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 36 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:54:30] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:54:31] [INFO ] Implicit Places using invariants in 807 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:54:31] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 16:54:32] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
[2022-05-17 16:54:32] [INFO ] Redundant transitions in 80 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:54:32] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 16:54:35] [INFO ] Dead Transitions using invariants and state equation in 2558 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 108 ms :[p1, p0, p1]
Running random walk in product with property : Philosophers-COL-000500-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (AND (GEQ s261 1) (GEQ s761 1)) (AND (GEQ s256 1) (GEQ s756 1)) (AND (GEQ s246 1) (GEQ s746 1)) (AND (GEQ s266 1) (GEQ s766 1)) (AND (GEQ s276...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 2628 ms.
Stack based approach found an accepted trace after 4462 steps with 0 reset with depth 4463 and stack size 4463 in 161 ms.
FORMULA Philosophers-COL-000500-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLFireability-14 finished in 8100 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((!G(p0) U p0)))||G(p0)))'
Found a CL insensitive property : Philosophers-COL-000500-LTLFireability-04
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 54 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:54:38] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 16:54:39] [INFO ] Implicit Places using invariants in 1360 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:54:39] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:54:42] [INFO ] Implicit Places using invariants and state equation in 2812 ms returned []
Implicit Place search using SMT with State Equation took 4174 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:54:42] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 16:54:45] [INFO ] Dead Transitions using invariants and state equation in 2636 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Running random walk in product with property : Philosophers-COL-000500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s2211 1) (GEQ s2471 1) (GEQ s2276 1) (GEQ s2406 1) (GEQ s2341 1) (GEQ s2000 1) (GEQ s2130 1) (GEQ s2065 1) (GEQ s2162 1) (GEQ s2227 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration timeout after 69580 steps with 1725 reset in 10001 ms.
Product exploration timeout after 67770 steps with 1701 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 : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 55 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:55:19] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 16:55:26] [INFO ] [Real]Absence check using 1000 positive place invariants in 1784 ms returned sat
[2022-05-17 16:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:55:34] [INFO ] [Real]Absence check using state equation in 8011 ms returned unknown
Could not prove EG (NOT p0)
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 56 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:55:34] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 16:55:35] [INFO ] Implicit Places using invariants in 1379 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:55:35] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 16:55:38] [INFO ] Implicit Places using invariants and state equation in 2824 ms returned []
Implicit Place search using SMT with State Equation took 4204 ms to find 0 implicit places.
[2022-05-17 16:55:38] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:55:38] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 16:55:41] [INFO ] Dead Transitions using invariants and state equation in 2631 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 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 : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:55:54] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 16:56:01] [INFO ] [Real]Absence check using 1000 positive place invariants in 1706 ms returned sat
[2022-05-17 16:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:56:09] [INFO ] [Real]Absence check using state equation in 8095 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration timeout after 69080 steps with 1705 reset in 10001 ms.
Product exploration timeout after 67350 steps with 1671 reset in 10001 ms.
Built C files in :
/tmp/ltsmin9299711381523412035
[2022-05-17 16:56:29] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:56:29] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9299711381523412035
Running compilation step : cd /tmp/ltsmin9299711381523412035;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9299711381523412035;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9299711381523412035;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 56 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:56:33] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:56:34] [INFO ] Implicit Places using invariants in 1337 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:56:34] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 16:56:37] [INFO ] Implicit Places using invariants and state equation in 2801 ms returned []
Implicit Place search using SMT with State Equation took 4139 ms to find 0 implicit places.
[2022-05-17 16:56:37] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:56:37] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 16:56:39] [INFO ] Dead Transitions using invariants and state equation in 2570 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin8605786960771511866
[2022-05-17 16:56:39] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:56:39] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8605786960771511866
Running compilation step : cd /tmp/ltsmin8605786960771511866;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8605786960771511866;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8605786960771511866;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 16:56:43] [INFO ] Flatten gal took : 71 ms
[2022-05-17 16:56:43] [INFO ] Flatten gal took : 72 ms
[2022-05-17 16:56:43] [INFO ] Time to serialize gal into /tmp/LTL1389572669216907004.gal : 8 ms
[2022-05-17 16:56:43] [INFO ] Time to serialize properties into /tmp/LTL12421179518523390902.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1389572669216907004.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12421179518523390902.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1389572...267
Read 1 LTL properties
Checking formula 0 : !(((F(X((!(G("((((((((((Eat_211>=1)||(Eat_471>=1))||((Eat_276>=1)||(Eat_406>=1)))||(((Eat_341>=1)||(Eat_0>=1))||((Eat_130>=1)||(Eat_65...23716
Formula 0 simplified : !(G"((((((((((Eat_211>=1)||(Eat_471>=1))||((Eat_276>=1)||(Eat_406>=1)))||(((Eat_341>=1)||(Eat_0>=1))||((Eat_130>=1)||(Eat_65>=1))))|...23703
Detected timeout of ITS tools.
[2022-05-17 16:56:58] [INFO ] Flatten gal took : 69 ms
[2022-05-17 16:56:58] [INFO ] Applying decomposition
[2022-05-17 16:56:58] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5207800360024380270.txt' '-o' '/tmp/graph5207800360024380270.bin' '-w' '/tmp/graph5207800360024380270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5207800360024380270.bin' '-l' '-1' '-v' '-w' '/tmp/graph5207800360024380270.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:56:58] [INFO ] Decomposing Gal with order
[2022-05-17 16:56:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:56:58] [INFO ] Removed a total of 499 redundant transitions.
[2022-05-17 16:56:58] [INFO ] Flatten gal took : 116 ms
[2022-05-17 16:56:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1692 labels/synchronizations in 22 ms.
[2022-05-17 16:56:59] [INFO ] Time to serialize gal into /tmp/LTL13536960604946797476.gal : 14 ms
[2022-05-17 16:56:59] [INFO ] Time to serialize properties into /tmp/LTL16937583296195083709.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13536960604946797476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16937583296195083709.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1353696...247
Read 1 LTL properties
Checking formula 0 : !(((F(X((!(G("((((((((((i5.i1.i0.u377.Eat_211>=1)||(i44.i1.i0.u256.Eat_471>=1))||((i17.i2.i0.u406.Eat_276>=1)||(i25.i0.i2.u461.Eat_406...45394
Formula 0 simplified : !(G"((((((((((i5.i1.i0.u377.Eat_211>=1)||(i44.i1.i0.u256.Eat_471>=1))||((i17.i2.i0.u406.Eat_276>=1)||(i25.i0.i2.u461.Eat_406>=1)))||...45381
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9039215594949332841
[2022-05-17 16:57:14] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9039215594949332841
Running compilation step : cd /tmp/ltsmin9039215594949332841;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9039215594949332841;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9039215594949332841;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Philosophers-COL-000500-LTLFireability-04 finished in 159617 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2022-05-17 16:57:18] [INFO ] Flatten gal took : 72 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13733629851144772245
[2022-05-17 16:57:18] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:57:18] [INFO ] Applying decomposition
[2022-05-17 16:57:18] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13733629851144772245
Running compilation step : cd /tmp/ltsmin13733629851144772245;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 16:57:18] [INFO ] Flatten gal took : 197 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5774208967736676615.txt' '-o' '/tmp/graph5774208967736676615.bin' '-w' '/tmp/graph5774208967736676615.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5774208967736676615.bin' '-l' '-1' '-v' '-w' '/tmp/graph5774208967736676615.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:57:18] [INFO ] Decomposing Gal with order
[2022-05-17 16:57:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:57:18] [INFO ] Removed a total of 498 redundant transitions.
[2022-05-17 16:57:19] [INFO ] Flatten gal took : 217 ms
[2022-05-17 16:57:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 1736 labels/synchronizations in 23 ms.
[2022-05-17 16:57:20] [INFO ] Time to serialize gal into /tmp/LTLFireability5867257406691741838.gal : 16 ms
[2022-05-17 16:57:20] [INFO ] Time to serialize properties into /tmp/LTLFireability1847995013163622178.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5867257406691741838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1847995013163622178.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !(((F(X((!(G("((((((((((i35.i0.i1.u367.Eat_211>=1)||(i45.i0.i1.u282.Eat_471>=1))||((i4.i0.i0.u401.Eat_276>=1)||(i25.i0.i0.u53.Eat_406>...45544
Formula 0 simplified : !(G"((((((((((i35.i0.i1.u367.Eat_211>=1)||(i45.i0.i1.u282.Eat_471>=1))||((i4.i0.i0.u401.Eat_276>=1)||(i25.i0.i0.u53.Eat_406>=1)))||(...45531
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Compilation finished in 5760 ms.
Running link step : cd /tmp/ltsmin13733629851144772245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13733629851144772245;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(X(() U (LTLAPp0==true))))||[]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 17:21:04] [INFO ] Applying decomposition
[2022-05-17 17:21:04] [INFO ] Flatten gal took : 172 ms
[2022-05-17 17:21:04] [INFO ] Decomposing Gal with order
[2022-05-17 17:21:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 17:21:04] [INFO ] Removed a total of 500 redundant transitions.
[2022-05-17 17:21:05] [INFO ] Flatten gal took : 309 ms
[2022-05-17 17:21:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1000 labels/synchronizations in 68 ms.
[2022-05-17 17:21:05] [INFO ] Time to serialize gal into /tmp/LTLFireability16378219402548197132.gal : 45 ms
[2022-05-17 17:21:05] [INFO ] Time to serialize properties into /tmp/LTLFireability11607293396410291004.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16378219402548197132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11607293396410291004.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !(((F(X((!(G("((((((((((Philo211.Eat_211>=1)||(Philo471.Eat_471>=1))||((Philo276.Eat_276>=1)||(Philo406.Eat_406>=1)))||(((Philo341.Eat...36886
Formula 0 simplified : !(G"((((((((((Philo211.Eat_211>=1)||(Philo471.Eat_471>=1))||((Philo276.Eat_276>=1)||(Philo406.Eat_406>=1)))||(((Philo341.Eat_341>=1)...36873
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
16727 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,167.587,2417920,1,0,6.81579e+06,1050,9586,5.29524e+06,76,570,6513333
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000500-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F("(((((((((((Philo103.Fork_103>=1)&&(Philo104.Catch2_104>=1))||((Philo98.Fork_98>=1)&&(Philo99.Catch2_99>=1)))||(((Philo394.Fork_3...26587
Formula 1 simplified : !F"(((((((((((Philo103.Fork_103>=1)&&(Philo104.Catch2_104>=1))||((Philo98.Fork_98>=1)&&(Philo99.Catch2_99>=1)))||(((Philo394.Fork_39...26583
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin13733629851144772245;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(X(() U (LTLAPp0==true))))||[]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13733629851144772245;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp1==true))' '--buchi-type=spotba'
Computing Next relation with stutter on 2 deadlock states
LTSmin run took 476985 ms.
FORMULA Philosophers-COL-000500-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2954337 ms.
BK_STOP 1652808921314
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-000500"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000500, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016400228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000500.tgz
mv Philosophers-COL-000500 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;