About the Execution of ITS-Tools for Philosophers-COL-002000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11576.844 | 3600000.00 | 8435782.00 | 8282.30 | ????F?TF?FFF??FF | 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-165277016400244.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-002000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016400244
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 6.4K Apr 29 13:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 13:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 12:27 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 25K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 96K 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-002000-LTLFireability-00
FORMULA_NAME Philosophers-COL-002000-LTLFireability-01
FORMULA_NAME Philosophers-COL-002000-LTLFireability-02
FORMULA_NAME Philosophers-COL-002000-LTLFireability-03
FORMULA_NAME Philosophers-COL-002000-LTLFireability-04
FORMULA_NAME Philosophers-COL-002000-LTLFireability-05
FORMULA_NAME Philosophers-COL-002000-LTLFireability-06
FORMULA_NAME Philosophers-COL-002000-LTLFireability-07
FORMULA_NAME Philosophers-COL-002000-LTLFireability-08
FORMULA_NAME Philosophers-COL-002000-LTLFireability-09
FORMULA_NAME Philosophers-COL-002000-LTLFireability-10
FORMULA_NAME Philosophers-COL-002000-LTLFireability-11
FORMULA_NAME Philosophers-COL-002000-LTLFireability-12
FORMULA_NAME Philosophers-COL-002000-LTLFireability-13
FORMULA_NAME Philosophers-COL-002000-LTLFireability-14
FORMULA_NAME Philosophers-COL-002000-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652809439637
Running Version 202205111006
[2022-05-17 17:44:00] [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 17:44:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 17:44:00] [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 17:44:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 17:44:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 611 ms
[2022-05-17 17:44:01] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 10000 PT places and 10000.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-17 17:44:01] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2022-05-17 17:44:01] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-002000-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 5 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10009 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :3
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 17:44:01] [INFO ] Flatten gal took : 13 ms
[2022-05-17 17:44:01] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 2000) 2000) 2000)]] contains successor/predecessor on variables of sort Philo
[2022-05-17 17:44:01] [INFO ] Unfolded HLPN to a Petri net with 10000 places and 10000 transitions 32000 arcs in 112 ms.
[2022-05-17 17:44:01] [INFO ] Unfolded 15 HLPN properties in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-002000-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-002000-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 57 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:44:03] [INFO ] Computed 4000 place invariants in 73 ms
[2022-05-17 17:44:04] [INFO ] Implicit Places using invariants in 1138 ms returned []
Implicit Place search using SMT only with invariants took 1167 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:44:04] [INFO ] Computed 4000 place invariants in 37 ms
[2022-05-17 17:44:05] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Support contains 10000 out of 10000 places after structural reductions.
[2022-05-17 17:44:07] [INFO ] Flatten gal took : 817 ms
[2022-05-17 17:44:11] [INFO ] Flatten gal took : 870 ms
[2022-05-17 17:44:15] [INFO ] Input system was already deterministic with 10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3624 ms. (steps per millisecond=2 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4324 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4225 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4219 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4258 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5063 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4301 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:44:45] [INFO ] Computed 4000 place invariants in 32 ms
[2022-05-17 17:45:05] [INFO ] [Real]Absence check using 4000 positive place invariants in 1463 ms returned sat
[2022-05-17 17:45:06] [INFO ] After 5442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 17:45:10] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1311 ms returned sat
[2022-05-17 17:45:31] [INFO ] After 18668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-17 17:45:32] [INFO ] After 18687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 17:45:32] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2000 steps, including 0 resets, run visited all 6 properties in 578 ms. (steps per millisecond=3 )
Parikh walk visited 6 properties in 584 ms.
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' '!((F(G(X((X(p1)&&p0))))||F(!p1)))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 469 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:45:34] [INFO ] Computed 4000 place invariants in 25 ms
[2022-05-17 17:45:35] [INFO ] Implicit Places using invariants in 900 ms returned []
Implicit Place search using SMT only with invariants took 905 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:45:35] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 17:45:35] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) p1)]
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s3666 1) (LT s5666 1)) (OR (LT s2482 1) (LT s4482 1)) (OR (LT s3079 1) (LT s5079 1)) (OR (LT s3069 1) (LT s5069 1)) (OR (LT s3656 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 13160 steps with 170 reset in 10003 ms.
Product exploration timeout after 13010 steps with 160 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 16 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 196 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) p1)]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 406 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:45:58] [INFO ] Computed 4000 place invariants in 17 ms
[2022-05-17 17:45:59] [INFO ] Implicit Places using invariants in 825 ms returned []
Implicit Place search using SMT only with invariants took 826 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:45:59] [INFO ] Computed 4000 place invariants in 21 ms
[2022-05-17 17:46:00] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) p1)]
Product exploration timeout after 13140 steps with 168 reset in 10005 ms.
Product exploration timeout after 12920 steps with 169 reset in 10004 ms.
Built C files in :
/tmp/ltsmin10415051901511503469
[2022-05-17 17:46:22] [INFO ] Too many transitions (10000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 17:46:22] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10415051901511503469
Running compilation step : cd /tmp/ltsmin10415051901511503469;'/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/ltsmin10415051901511503469;'/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/ltsmin10415051901511503469;'/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 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 283 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:46:25] [INFO ] Computed 4000 place invariants in 17 ms
[2022-05-17 17:46:26] [INFO ] Implicit Places using invariants in 887 ms returned []
Implicit Place search using SMT only with invariants took 897 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:46:26] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 17:46:27] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin7231569895547992106
[2022-05-17 17:46:27] [INFO ] Too many transitions (10000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 17:46:27] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7231569895547992106
Running compilation step : cd /tmp/ltsmin7231569895547992106;'/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/ltsmin7231569895547992106;'/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/ltsmin7231569895547992106;'/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 17:46:32] [INFO ] Flatten gal took : 445 ms
[2022-05-17 17:46:32] [INFO ] Flatten gal took : 301 ms
[2022-05-17 17:46:33] [INFO ] Time to serialize gal into /tmp/LTL1499266644259685368.gal : 73 ms
[2022-05-17 17:46:33] [INFO ] Time to serialize properties into /tmp/LTL7204467045081720035.ltl : 18 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/LTL1499266644259685368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7204467045081720035.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/LTL1499266...266
Read 1 LTL properties
Checking formula 0 : !(((F(G(X((((((((((((X("((((((((((((Eat_1166<1)&&(Eat_1345<1))&&((Eat_1605<1)&&(Eat_1946<1)))&&(((Eat_126<1)&&(Eat_906<1))&&((Eat_305<...133647
Formula 0 simplified : !(FGX("((((((((((((Fork_1751<1)||(Catch1_1751<1))&&((Fork_567<1)||(Catch1_567<1)))&&(((Fork_527<1)||(Catch1_527<1))&&((Fork_984<1)||...133603
Detected timeout of ITS tools.
[2022-05-17 17:46:48] [INFO ] Flatten gal took : 301 ms
[2022-05-17 17:46:48] [INFO ] Applying decomposition
[2022-05-17 17:46:48] [INFO ] Flatten gal took : 400 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/graph17283273915943731936.txt' '-o' '/tmp/graph17283273915943731936.bin' '-w' '/tmp/graph17283273915943731936.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17283273915943731936.bin' '-l' '-1' '-v' '-w' '/tmp/graph17283273915943731936.weights' '-q' '0' '-e' '0.001'
[2022-05-17 17:46:49] [INFO ] Decomposing Gal with order
[2022-05-17 17:46:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 17:46:54] [INFO ] Removed a total of 1987 redundant transitions.
[2022-05-17 17:46:54] [INFO ] Flatten gal took : 912 ms
[2022-05-17 17:47:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 6662 labels/synchronizations in 231 ms.
[2022-05-17 17:47:13] [INFO ] Time to serialize gal into /tmp/LTL5064542112531202087.gal : 129 ms
[2022-05-17 17:47:13] [INFO ] Time to serialize properties into /tmp/LTL7526732297645991176.ltl : 71 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/LTL5064542112531202087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7526732297645991176.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/LTL5064542...245
Read 1 LTL properties
Checking formula 0 : !(((F(G(X((((((((((((X("((((((((((((i33.i1.i1.i1.u1643.Eat_1166<1)&&(i74.i0.i0.i0.u188.Eat_1345<1))&&((i41.i1.i2.i1.u1826.Eat_1605<1)&...272135
Formula 0 simplified : !(FGX("((((((((((((i44.i0.i1.i0.u961.Fork_1751<1)||(i44.i0.i1.i0.u961.Catch1_1751<1))&&((i5.i1.i1.i1.u500.Fork_567<1)||(i5.i1.i1.i1....272091
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10821492759623482072
[2022-05-17 17:47:28] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10821492759623482072
Running compilation step : cd /tmp/ltsmin10821492759623482072;'/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/ltsmin10821492759623482072;'/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/ltsmin10821492759623482072;'/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-002000-LTLFireability-00 finished in 118202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G((G(p1)&&p0))||X((X(!p1)&&p2))))))'
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1139 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:47:33] [INFO ] Computed 4000 place invariants in 16 ms
[2022-05-17 17:47:34] [INFO ] Implicit Places using invariants in 1061 ms returned []
Implicit Place search using SMT only with invariants took 1064 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:47:34] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:47:35] [INFO ] Dead Transitions using invariants and state equation in 955 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 493 ms :[true, (OR (NOT p2) p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND p1 (NOT p0))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}, { cond=(AND p1 p0), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p0), acceptance={} source=5 dest: 2}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=7 dest: 0}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}]], initial=4, aps=[p2:(OR (AND (GEQ s330 1) (GEQ s2329 1)) (AND (GEQ s917 1) (GEQ s2916 1)) (AND (GEQ s907 1) (GEQ s2906 1)) (AND (GEQ s927 1) (GEQ s2926 1)) (AND (GEQ s947 ...], 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 9410 ms.
Product exploration timeout after 96360 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 171 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3483 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5375 ms. (steps per millisecond=1 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 5003 steps, including 1 resets, run timeout after 5011 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5925 ms. (steps per millisecond=1 ) properties seen 0
Probabilistic random walk exhausted memory after 263593 steps, saw 263431 distinct states, run finished after 25443 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:48:41] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 17:49:05] [INFO ] [Real]Absence check using 4000 positive place invariants in 1442 ms returned sat
[2022-05-17 17:49:09] [INFO ] After 17951ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 17:49:21] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1442 ms returned sat
[2022-05-17 17:49:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 17:49:34] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 815 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3439 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4451 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5241 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5238 ms. (steps per millisecond=1 ) properties seen 0
Probabilistic random walk exhausted memory after 263719 steps, saw 263553 distinct states, run finished after 24048 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:50:18] [INFO ] Computed 4000 place invariants in 21 ms
[2022-05-17 17:50:43] [INFO ] [Real]Absence check using 4000 positive place invariants in 1460 ms returned sat
[2022-05-17 17:50:47] [INFO ] After 17817ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 17:50:59] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1369 ms returned sat
[2022-05-17 17:51:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 17:51:12] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 834 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 726 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:51:14] [INFO ] Computed 4000 place invariants in 15 ms
[2022-05-17 17:51:15] [INFO ] Implicit Places using invariants in 849 ms returned []
Implicit Place search using SMT only with invariants took 851 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:51:15] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:51:15] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 146 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 693 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:51:17] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:51:17] [INFO ] Implicit Places using invariants in 873 ms returned []
Implicit Place search using SMT only with invariants took 874 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:51:17] [INFO ] Computed 4000 place invariants in 23 ms
[2022-05-17 17:51:18] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3451 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4564 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5112 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5118 ms. (steps per millisecond=1 ) properties seen 0
Probabilistic random walk exhausted memory after 263593 steps, saw 263431 distinct states, run finished after 24072 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:52:01] [INFO ] Computed 4000 place invariants in 21 ms
[2022-05-17 17:52:24] [INFO ] [Real]Absence check using 4000 positive place invariants in 1483 ms returned sat
[2022-05-17 17:52:28] [INFO ] After 16377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 17:52:40] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1353 ms returned sat
[2022-05-17 17:52:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 17:52:53] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 802 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3415 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4511 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5310 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5297 ms. (steps per millisecond=1 ) properties seen 0
Probabilistic random walk exhausted memory after 263622 steps, saw 263460 distinct states, run finished after 22903 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:53:35] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:54:02] [INFO ] [Real]Absence check using 4000 positive place invariants in 1537 ms returned sat
[2022-05-17 17:54:07] [INFO ] After 21057ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 17:54:20] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1487 ms returned sat
[2022-05-17 17:54:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 17:54:33] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 753 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 709 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:54:34] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 17:54:35] [INFO ] Implicit Places using invariants in 957 ms returned []
Implicit Place search using SMT only with invariants took 958 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:54:35] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 17:54:36] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Knowledge obtained : [(AND p2 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 41 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 153 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 140 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 0 reset in 9166 ms.
Product exploration timeout after 97620 steps with 0 reset in 10001 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 169 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 834 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:54:57] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:54:58] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Product exploration explored 100000 steps with 0 reset in 9151 ms.
Product exploration timeout after 95360 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin14466657114980785503
[2022-05-17 17:55:17] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14466657114980785503
Running compilation step : cd /tmp/ltsmin14466657114980785503;'/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/ltsmin14466657114980785503;'/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/ltsmin14466657114980785503;'/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 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 816 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:55:21] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:55:22] [INFO ] Implicit Places using invariants in 992 ms returned []
Implicit Place search using SMT only with invariants took 995 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:55:22] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 17:55:23] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin17851382187790874960
[2022-05-17 17:55:23] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17851382187790874960
Running compilation step : cd /tmp/ltsmin17851382187790874960;'/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/ltsmin17851382187790874960;'/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/ltsmin17851382187790874960;'/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 17:55:27] [INFO ] Flatten gal took : 391 ms
[2022-05-17 17:55:27] [INFO ] Flatten gal took : 466 ms
[2022-05-17 17:55:27] [INFO ] Time to serialize gal into /tmp/LTL10864879256047739101.gal : 41 ms
[2022-05-17 17:55:27] [INFO ] Time to serialize properties into /tmp/LTL17367911535076124441.ltl : 26 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/LTL10864879256047739101.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17367911535076124441.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/LTL1086487...268
Read 1 LTL properties
Checking formula 0 : !((G(X((G((((((((((((G("(((((((((((((Think_1895<1)||(Fork_1895<1))&&((Think_134<1)||(Fork_134<1)))&&(((Think_1288<1)||(Fork_1288<1))&&...279214
Formula 0 simplified : !GX(G("((((((((((((Think_385<1)||(Fork_384<1))&&((Think_842<1)||(Fork_841<1)))&&(((Think_882<1)||(Fork_881<1))&&((Think_235<1)||(For...279167
Detected timeout of ITS tools.
[2022-05-17 17:55:43] [INFO ] Flatten gal took : 323 ms
[2022-05-17 17:55:43] [INFO ] Applying decomposition
[2022-05-17 17:55:43] [INFO ] Flatten gal took : 330 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/graph1809179372613308654.txt' '-o' '/tmp/graph1809179372613308654.bin' '-w' '/tmp/graph1809179372613308654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1809179372613308654.bin' '-l' '-1' '-v' '-w' '/tmp/graph1809179372613308654.weights' '-q' '0' '-e' '0.001'
[2022-05-17 17:55:44] [INFO ] Decomposing Gal with order
[2022-05-17 17:55:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 17:55:48] [INFO ] Removed a total of 1977 redundant transitions.
[2022-05-17 17:55:49] [INFO ] Flatten gal took : 784 ms
[2022-05-17 17:56:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 6812 labels/synchronizations in 263 ms.
[2022-05-17 17:56:29] [INFO ] Time to serialize gal into /tmp/LTL13574293752373081311.gal : 68 ms
[2022-05-17 17:56:29] [INFO ] Time to serialize properties into /tmp/LTL12303732365580986145.ltl : 42 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13574293752373081311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12303732365580986145.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/LTL1357429...247
Read 1 LTL properties
Checking formula 0 : !((G(X((G((((((((((((G("(((((((((((((i56.i0.i0.i1.u1940.Think_1895<1)||(i56.i0.i0.i1.u1940.Fork_1895<1))&&((i61.i1.i1.i1.u13.Think_134...565018
Formula 0 simplified : !GX(G("((((((((((((i2.i2.i1.i2.u1359.Think_385<1)||(i2.i2.i1.i1.u1358.Fork_384<1))&&((i7.i1.i1.i1.u1532.Think_842<1)||(i7.i1.i1.i1.u...564971
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5911581910362819830
[2022-05-17 17:56:44] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5911581910362819830
Running compilation step : cd /tmp/ltsmin5911581910362819830;'/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/ltsmin5911581910362819830;'/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/ltsmin5911581910362819830;'/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-002000-LTLFireability-01 finished in 555605 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 376 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:56:47] [INFO ] Computed 4000 place invariants in 16 ms
[2022-05-17 17:56:48] [INFO ] Implicit Places using invariants in 874 ms returned []
Implicit Place search using SMT only with invariants took 886 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:56:48] [INFO ] Computed 4000 place invariants in 16 ms
[2022-05-17 17:56:49] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s3871 1) (GEQ s7872 1)) (AND (GEQ s2110 1) (GEQ s6111 1)) (AND (GEQ s3264 1) (GEQ s7265 1)) (AND (GEQ s2080 1) (GEQ s6081 1)) (AND (GEQ s...], 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 13480 steps with 4504 reset in 10002 ms.
Product exploration timeout after 13410 steps with 4530 reset in 10007 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)]
Knowledge based reduction with 1 factoid took 79 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 28 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 83 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 33 ms :[(NOT p0)]
[2022-05-17 17:58:51] [WARNING] OOM error produced while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 417 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:58:52] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:58:53] [INFO ] Implicit Places using invariants in 979 ms returned []
Implicit Place search using SMT only with invariants took 981 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:58:53] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:58:53] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 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)]
Knowledge based reduction with 1 factoid took 145 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)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 75 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 30 ms :[(NOT p0)]
[2022-05-17 18:00:27] [WARNING] OOM error produced while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration timeout after 13820 steps with 4587 reset in 10006 ms.
Product exploration timeout after 13430 steps with 4532 reset in 10020 ms.
Built C files in :
/tmp/ltsmin8301692873242462372
[2022-05-17 18:00:47] [INFO ] Too many transitions (10000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 18:00:47] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8301692873242462372
Running compilation step : cd /tmp/ltsmin8301692873242462372;'/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/ltsmin8301692873242462372;'/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/ltsmin8301692873242462372;'/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 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 528 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:00:51] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 18:00:52] [INFO ] Implicit Places using invariants in 893 ms returned []
Implicit Place search using SMT only with invariants took 896 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:00:52] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 18:00:52] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin12877435984795884602
[2022-05-17 18:00:52] [INFO ] Too many transitions (10000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 18:00:53] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12877435984795884602
Running compilation step : cd /tmp/ltsmin12877435984795884602;'/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/ltsmin12877435984795884602;'/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/ltsmin12877435984795884602;'/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 18:00:57] [INFO ] Flatten gal took : 470 ms
[2022-05-17 18:00:57] [INFO ] Flatten gal took : 370 ms
[2022-05-17 18:00:57] [INFO ] Time to serialize gal into /tmp/LTL2916366017091283049.gal : 27 ms
[2022-05-17 18:00:57] [INFO ] Time to serialize properties into /tmp/LTL16789298499433480593.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/LTL2916366017091283049.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16789298499433480593.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/LTL2916366...267
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((((((Fork_1871>=1)&&(Catch2_1872>=1))||((Fork_110>=1)&&(Catch2_111>=1)))||(((Fork_1264>=1)&&(Catch2_1265>=1))||((Fork_80...73807
Formula 0 simplified : !F"(((((((((((((Fork_1871>=1)&&(Catch2_1872>=1))||((Fork_110>=1)&&(Catch2_111>=1)))||(((Fork_1264>=1)&&(Catch2_1265>=1))||((Fork_80>...73803
Detected timeout of ITS tools.
[2022-05-17 18:01:12] [INFO ] Flatten gal took : 298 ms
[2022-05-17 18:01:12] [INFO ] Applying decomposition
[2022-05-17 18:01:13] [INFO ] Flatten gal took : 297 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/graph9341892227045931907.txt' '-o' '/tmp/graph9341892227045931907.bin' '-w' '/tmp/graph9341892227045931907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9341892227045931907.bin' '-l' '-1' '-v' '-w' '/tmp/graph9341892227045931907.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:01:14] [INFO ] Decomposing Gal with order
[2022-05-17 18:01:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:01:18] [INFO ] Removed a total of 1987 redundant transitions.
[2022-05-17 18:01:18] [INFO ] Flatten gal took : 448 ms
[2022-05-17 18:01:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 6774 labels/synchronizations in 255 ms.
[2022-05-17 18:01:28] [INFO ] Time to serialize gal into /tmp/LTL2381522774448072157.gal : 48 ms
[2022-05-17 18:01:28] [INFO ] Time to serialize properties into /tmp/LTL308345925430059809.ltl : 10 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/LTL2381522774448072157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL308345925430059809.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/LTL2381522...244
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((((((i48.i2.i0.i1.u1933.Fork_1871>=1)&&(i48.i2.i0.i0.u1934.Catch2_1872>=1))||((i61.i0.i0.i0.u18.Fork_110>=1)&&(i61.i0.i1...144042
Formula 0 simplified : !F"(((((((((((((i48.i2.i0.i1.u1933.Fork_1871>=1)&&(i48.i2.i0.i0.u1934.Catch2_1872>=1))||((i61.i0.i0.i0.u18.Fork_110>=1)&&(i61.i0.i1....144038
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6770464664387428824
[2022-05-17 18:01:43] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6770464664387428824
Running compilation step : cd /tmp/ltsmin6770464664387428824;'/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/ltsmin6770464664387428824;'/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/ltsmin6770464664387428824;'/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-002000-LTLFireability-02 finished in 299240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||G(X((X(X(!p0))||p1)))))'
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 647 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:01:47] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 18:01:48] [INFO ] Implicit Places using invariants in 819 ms returned []
Implicit Place search using SMT only with invariants took 819 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:01:48] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 18:01:48] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 258 ms :[false, false, false, false, p0, (AND (NOT p1) p0), p0, true, false, (NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 7}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(OR (AND (GEQ s330 1) (GEQ s2329 1)) (AND (GEQ s917 1) (GEQ s2916 1)) (AND (GEQ s907 1) (GEQ s2906 1)) (AND (GEQ s927 1) (GEQ s2926 1)) (AND (GEQ s947 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 9276 ms.
Product exploration timeout after 94660 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 10 states, 17 edges and 2 AP to 10 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 272 ms :[false, false, false, false, p0, (AND (NOT p1) p0), p0, true, false, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3537 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4370 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5243 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5116 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4386 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Probabilistic random walk exhausted memory after 263651 steps, saw 263485 distinct states, run finished after 28136 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:03:00] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 18:03:20] [INFO ] [Real]Absence check using 4000 positive place invariants in 1391 ms returned sat
[2022-05-17 18:03:21] [INFO ] After 7527ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-17 18:03:24] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1389 ms returned sat
[2022-05-17 18:03:46] [INFO ] After 19004ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-17 18:03:46] [INFO ] After 19016ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 18:03:46] [INFO ] After 25081ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1976 steps, including 0 resets, run visited all 3 properties in 560 ms. (steps per millisecond=3 )
Parikh walk visited 3 properties in 563 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 10 states, 16 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0, true]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0, true]
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 637 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:03:48] [INFO ] Computed 4000 place invariants in 24 ms
[2022-05-17 18:03:49] [INFO ] Implicit Places using invariants in 1013 ms returned []
Implicit Place search using SMT only with invariants took 1018 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:03:49] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 18:03:50] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 39 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3411 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4363 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4359 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Probabilistic random walk exhausted memory after 263529 steps, saw 263367 distinct states, run finished after 22302 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:04:25] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 18:04:32] [INFO ] [Real]Absence check using 4000 positive place invariants in 1333 ms returned sat
[2022-05-17 18:04:32] [INFO ] After 3241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 18:04:35] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1460 ms returned sat
[2022-05-17 18:04:57] [INFO ] After 20485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:04:57] [INFO ] After 20497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 18:04:57] [INFO ] After 25068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1961 steps, including 0 resets, run visited all 2 properties in 584 ms. (steps per millisecond=3 )
Parikh walk visited 2 properties in 587 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0, true]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0, true]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0, true]
Product exploration explored 100000 steps with 0 reset in 8035 ms.
Product exploration explored 100000 steps with 0 reset in 9039 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0, true]
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 691 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:05:17] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 18:05:18] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Product exploration explored 100000 steps with 0 reset in 8054 ms.
Product exploration explored 100000 steps with 0 reset in 8934 ms.
Built C files in :
/tmp/ltsmin5648999747478353888
[2022-05-17 18:05:35] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5648999747478353888
Running compilation step : cd /tmp/ltsmin5648999747478353888;'/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/ltsmin5648999747478353888;'/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/ltsmin5648999747478353888;'/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 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 588 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:05:38] [INFO ] Computed 4000 place invariants in 25 ms
[2022-05-17 18:05:39] [INFO ] Implicit Places using invariants in 979 ms returned []
Implicit Place search using SMT only with invariants took 981 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:05:39] [INFO ] Computed 4000 place invariants in 24 ms
[2022-05-17 18:05:40] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin8693961238063709718
[2022-05-17 18:05:40] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8693961238063709718
Running compilation step : cd /tmp/ltsmin8693961238063709718;'/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/ltsmin8693961238063709718;'/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/ltsmin8693961238063709718;'/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 18:05:44] [INFO ] Flatten gal took : 313 ms
[2022-05-17 18:05:45] [INFO ] Flatten gal took : 323 ms
[2022-05-17 18:05:45] [INFO ] Time to serialize gal into /tmp/LTL929648405646302026.gal : 27 ms
[2022-05-17 18:05:45] [INFO ] Time to serialize properties into /tmp/LTL8846462511278224427.ltl : 14 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/LTL929648405646302026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8846462511278224427.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/LTL9296484...265
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("(((((((((((((Think_330>=1)&&(Fork_329>=1))||((Think_917>=1)&&(Fork_916>=1)))||(((Think_907>=1)&&(Fork_906>=1))||((Think_927...211433
Formula 0 simplified : !(XXG"(((((((((((((Think_330>=1)&&(Fork_329>=1))||((Think_917>=1)&&(Fork_916>=1)))||(((Think_907>=1)&&(Fork_906>=1))||((Think_927>=1...211385
Detected timeout of ITS tools.
[2022-05-17 18:06:00] [INFO ] Flatten gal took : 310 ms
[2022-05-17 18:06:00] [INFO ] Applying decomposition
[2022-05-17 18:06:00] [INFO ] Flatten gal took : 313 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/graph131482448645743073.txt' '-o' '/tmp/graph131482448645743073.bin' '-w' '/tmp/graph131482448645743073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph131482448645743073.bin' '-l' '-1' '-v' '-w' '/tmp/graph131482448645743073.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:06:01] [INFO ] Decomposing Gal with order
[2022-05-17 18:06:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:06:05] [INFO ] Removed a total of 1984 redundant transitions.
[2022-05-17 18:06:05] [INFO ] Flatten gal took : 484 ms
[2022-05-17 18:06:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 6652 labels/synchronizations in 232 ms.
[2022-05-17 18:06:33] [INFO ] Time to serialize gal into /tmp/LTL15896992106563297536.gal : 45 ms
[2022-05-17 18:06:33] [INFO ] Time to serialize properties into /tmp/LTL2782308837658823584.ltl : 29 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/LTL15896992106563297536.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2782308837658823584.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/LTL1589699...246
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("(((((((((((((i3.i0.i0.i1.u397.Think_330>=1)&&(i3.i0.i0.i1.u1275.Fork_329>=1))||((i70.i1.i0.i0.u1098.Think_917>=1)&&(i70.i1....419534
Formula 0 simplified : !(XXG"(((((((((((((i3.i0.i0.i1.u397.Think_330>=1)&&(i3.i0.i0.i1.u1275.Fork_329>=1))||((i70.i1.i0.i0.u1098.Think_917>=1)&&(i70.i1.i0....419486
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6633848817568838621
[2022-05-17 18:06:48] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6633848817568838621
Running compilation step : cd /tmp/ltsmin6633848817568838621;'/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/ltsmin6633848817568838621;'/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/ltsmin6633848817568838621;'/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-002000-LTLFireability-03 finished in 305019 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F((G(p0)&&F(p1)))&&X(p2)))&&F(!p1)))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 386 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:06:52] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 18:06:53] [INFO ] Implicit Places using invariants in 987 ms returned []
Implicit Place search using SMT only with invariants took 988 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:06:53] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 18:06:54] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, (OR (NOT p1) (NOT p0) (NOT p2)), p1, (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (NOT p1), true]
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 6}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (OR (LT s330 1) (LT s2329 1)) (OR (LT s917 1) (LT s2916 1)) (OR (LT s907 1) (LT s2906 1)) (OR (LT s927 1) (LT s2926 1)) (OR (LT s947 1) (LT s2946 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 9753 ms.
Stack based approach found an accepted trace after 27237 steps with 0 reset with depth 27238 and stack size 27238 in 3936 ms.
FORMULA Philosophers-COL-002000-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-002000-LTLFireability-04 finished in 16356 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X((X(X(F(p1)))||p0))))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 353 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:07:08] [INFO ] Computed 4000 place invariants in 27 ms
[2022-05-17 18:07:09] [INFO ] Implicit Places using invariants in 993 ms returned []
Implicit Place search using SMT only with invariants took 998 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:07:09] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 18:07:10] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s3666 1) (GEQ s5666 1)) (AND (GEQ s2482 1) (GEQ s4482 1)) (AND (GEQ s3079 1) (GEQ s5079 1)) (AND (GEQ s3069 1) (GEQ s5069 1)) (AND (GEQ s...], 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 0 reset in 9251 ms.
Product exploration explored 100000 steps with 0 reset in 9523 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3335 steps, including 1 resets, run visited all 2 properties in 1099 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 198 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:07:33] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 18:07:34] [INFO ] Implicit Places using invariants in 888 ms returned []
Implicit Place search using SMT only with invariants took 897 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:07:34] [INFO ] Computed 4000 place invariants in 15 ms
[2022-05-17 18:07:35] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 8201 ms.
Product exploration explored 100000 steps with 0 reset in 9784 ms.
Built C files in :
/tmp/ltsmin10297719666337799152
[2022-05-17 18:07:55] [INFO ] Too many transitions (10000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 18:07:55] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10297719666337799152
Running compilation step : cd /tmp/ltsmin10297719666337799152;'/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/ltsmin10297719666337799152;'/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/ltsmin10297719666337799152;'/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 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 246 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:07:59] [INFO ] Computed 4000 place invariants in 27 ms
[2022-05-17 18:08:00] [INFO ] Implicit Places using invariants in 974 ms returned []
Implicit Place search using SMT only with invariants took 976 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:08:00] [INFO ] Computed 4000 place invariants in 23 ms
[2022-05-17 18:08:01] [INFO ] Dead Transitions using invariants and state equation in 990 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin8130063512274691133
[2022-05-17 18:08:01] [INFO ] Too many transitions (10000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 18:08:01] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8130063512274691133
Running compilation step : cd /tmp/ltsmin8130063512274691133;'/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/ltsmin8130063512274691133;'/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/ltsmin8130063512274691133;'/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 18:08:05] [INFO ] Flatten gal took : 343 ms
[2022-05-17 18:08:05] [INFO ] Flatten gal took : 352 ms
[2022-05-17 18:08:05] [INFO ] Time to serialize gal into /tmp/LTL16130649976689352173.gal : 30 ms
[2022-05-17 18:08:05] [INFO ] Time to serialize properties into /tmp/LTL3949285447212200231.ltl : 11 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/LTL16130649976689352173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3949285447212200231.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/LTL1613064...267
Read 1 LTL properties
Checking formula 0 : !((F(X(G(X((((((((((((X(X(F("(((((((((((((Fork_1871<1)||(Catch2_1872<1))&&((Fork_110<1)||(Catch2_111<1)))&&(((Fork_1264<1)||(Catch2_12...143649
Formula 0 simplified : !FXGX("((((((((((((Fork_1751>=1)&&(Catch1_1751>=1))||((Fork_567>=1)&&(Catch1_567>=1)))||(((Fork_527>=1)&&(Catch1_527>=1))||((Fork_98...143602
Detected timeout of ITS tools.
[2022-05-17 18:08:20] [INFO ] Flatten gal took : 325 ms
[2022-05-17 18:08:20] [INFO ] Applying decomposition
[2022-05-17 18:08:21] [INFO ] Flatten gal took : 342 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/graph13835788172779713946.txt' '-o' '/tmp/graph13835788172779713946.bin' '-w' '/tmp/graph13835788172779713946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13835788172779713946.bin' '-l' '-1' '-v' '-w' '/tmp/graph13835788172779713946.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:08:22] [INFO ] Decomposing Gal with order
[2022-05-17 18:08:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:08:26] [INFO ] Removed a total of 1974 redundant transitions.
[2022-05-17 18:08:26] [INFO ] Flatten gal took : 496 ms
[2022-05-17 18:08:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 6642 labels/synchronizations in 232 ms.
[2022-05-17 18:08:45] [INFO ] Time to serialize gal into /tmp/LTL14363396732195629564.gal : 45 ms
[2022-05-17 18:08:45] [INFO ] Time to serialize properties into /tmp/LTL3883754440962707302.ltl : 22 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/LTL14363396732195629564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3883754440962707302.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/LTL1436339...246
Read 1 LTL properties
Checking formula 0 : !((F(X(G(X((((((((((((X(X(F("(((((((((((((i46.i0.i2.i1.u231.Fork_1871<1)||(i46.i0.i2.i1.u231.Catch2_1872<1))&&((i1.i1.i1.i0.u292.Fork_...283013
Formula 0 simplified : !FXGX("((((((((((((i44.i1.i1.i0.u1880.Fork_1751>=1)&&(i44.i1.i1.i0.u1880.Catch1_1751>=1))||((i2.i1.i1.i2.u1400.Fork_567>=1)&&(i2.i1....282966
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8575083495371479634
[2022-05-17 18:09:00] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8575083495371479634
Running compilation step : cd /tmp/ltsmin8575083495371479634;'/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/ltsmin8575083495371479634;'/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/ltsmin8575083495371479634;'/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-002000-LTLFireability-05 finished in 115839 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G((X(F(F(p0)))||X(G(p1)))))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 474 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:09:04] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 18:09:05] [INFO ] Implicit Places using invariants in 802 ms returned []
Implicit Place search using SMT only with invariants took 805 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:09:05] [INFO ] Computed 4000 place invariants in 27 ms
[2022-05-17 18:09:06] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s3871 1) (LT s7872 1)) (OR (LT s2110 1) (LT s6111 1)) (OR (LT s3264 1) (LT s7265 1)) (OR (LT s2080 1) (LT s6081 1)) (OR (LT s3284 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 8187 ms.
Stack based approach found an accepted trace after 42557 steps with 0 reset with depth 42558 and stack size 10520 in 5097 ms.
FORMULA Philosophers-COL-002000-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-002000-LTLFireability-07 finished in 15536 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(p0) U G(X(!p1))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 254 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:09:19] [INFO ] Computed 4000 place invariants in 26 ms
[2022-05-17 18:09:20] [INFO ] Implicit Places using invariants in 992 ms returned []
Implicit Place search using SMT only with invariants took 995 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:09:20] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 18:09:21] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s1895 1) (GEQ s3895 1)) (AND (GEQ s134 1) (GEQ s2134 1)) (AND (GEQ s1288 1) (GEQ s3288 1)) (AND (GEQ s1298 1) (GEQ s3298 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 16550 steps with 4473 reset in 10002 ms.
Product exploration timeout after 15900 steps with 4312 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3296 ms. (steps per millisecond=3 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5450 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:09:51] [INFO ] Computed 4000 place invariants in 25 ms
[2022-05-17 18:09:57] [INFO ] [Real]Absence check using 4000 positive place invariants in 1796 ms returned sat
[2022-05-17 18:09:57] [INFO ] After 3166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:10:00] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1424 ms returned sat
[2022-05-17 18:10:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:10:22] [INFO ] After 25110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 677 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3309 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4554 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 259657 steps, run timeout after 21032 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 259657 steps, saw 259495 distinct states, run finished after 21036 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:10:52] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 18:10:57] [INFO ] [Real]Absence check using 4000 positive place invariants in 1374 ms returned sat
[2022-05-17 18:10:57] [INFO ] After 2783ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:11:00] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1603 ms returned sat
[2022-05-17 18:11:22] [INFO ] After 25091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 759 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 630 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:11:24] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 18:11:25] [INFO ] Implicit Places using invariants in 880 ms returned []
Implicit Place search using SMT only with invariants took 881 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:11:25] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 18:11:26] [INFO ] Dead Transitions using invariants and state equation in 987 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
[2022-05-17 18:13:05] [WARNING] OOM error produced while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 271 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:13:06] [INFO ] Computed 4000 place invariants in 30 ms
[2022-05-17 18:13:06] [INFO ] Implicit Places using invariants in 973 ms returned []
Implicit Place search using SMT only with invariants took 974 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:13:07] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 18:13:07] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3290 ms. (steps per millisecond=3 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4471 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:13:16] [INFO ] Computed 4000 place invariants in 36 ms
[2022-05-17 18:13:21] [INFO ] [Real]Absence check using 4000 positive place invariants in 1359 ms returned sat
[2022-05-17 18:13:21] [INFO ] After 2777ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:13:24] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1362 ms returned sat
[2022-05-17 18:13:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:13:46] [INFO ] After 25116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 754 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3256 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4532 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Probabilistic random walk after 261656 steps, saw 261495 distinct states, run finished after 21056 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:14:16] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 18:14:21] [INFO ] [Real]Absence check using 4000 positive place invariants in 1358 ms returned sat
[2022-05-17 18:14:21] [INFO ] After 2832ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:14:24] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1385 ms returned sat
[2022-05-17 18:14:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:14:46] [INFO ] After 25114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 718 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 669 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:14:48] [INFO ] Computed 4000 place invariants in 21 ms
[2022-05-17 18:14:49] [INFO ] Implicit Places using invariants in 871 ms returned []
Implicit Place search using SMT only with invariants took 872 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:14:49] [INFO ] Computed 4000 place invariants in 23 ms
[2022-05-17 18:14:49] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
[2022-05-17 18:16:30] [WARNING] OOM error produced while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Product exploration timeout after 16610 steps with 4506 reset in 10008 ms.
Product exploration timeout after 16180 steps with 4423 reset in 10009 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 346 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:16:51] [INFO ] Computed 4000 place invariants in 23 ms
[2022-05-17 18:16:52] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Product exploration timeout after 10690 steps with 2923 reset in 10007 ms.
Product exploration timeout after 10420 steps with 2859 reset in 10002 ms.
Built C files in :
/tmp/ltsmin1864072763831142294
[2022-05-17 18:17:12] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1864072763831142294
Running compilation step : cd /tmp/ltsmin1864072763831142294;'/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/ltsmin1864072763831142294;'/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/ltsmin1864072763831142294;'/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 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 278 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:17:15] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 18:17:16] [INFO ] Implicit Places using invariants in 998 ms returned []
Implicit Place search using SMT only with invariants took 999 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:17:16] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 18:17:17] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin4272579234958420836
[2022-05-17 18:17:17] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4272579234958420836
Running compilation step : cd /tmp/ltsmin4272579234958420836;'/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/ltsmin4272579234958420836;'/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/ltsmin4272579234958420836;'/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 18:17:21] [INFO ] Flatten gal took : 433 ms
[2022-05-17 18:17:22] [INFO ] Flatten gal took : 312 ms
[2022-05-17 18:17:22] [INFO ] Time to serialize gal into /tmp/LTL12831218010270264307.gal : 27 ms
[2022-05-17 18:17:22] [INFO ] Time to serialize properties into /tmp/LTL754155079121362963.ltl : 10 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/LTL12831218010270264307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL754155079121362963.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/LTL1283121...266
Read 1 LTL properties
Checking formula 0 : !((!((G("(((((((((((((Think_1895>=1)&&(Fork_1895>=1))||((Think_134>=1)&&(Fork_134>=1)))||(((Think_1288>=1)&&(Fork_1288>=1))||((Think_1...145602
Formula 0 simplified : G"(((((((((((((Think_1895>=1)&&(Fork_1895>=1))||((Think_134>=1)&&(Fork_134>=1)))||(((Think_1288>=1)&&(Fork_1288>=1))||((Think_1298>=...145586
Detected timeout of ITS tools.
[2022-05-17 18:17:37] [INFO ] Flatten gal took : 354 ms
[2022-05-17 18:17:37] [INFO ] Applying decomposition
[2022-05-17 18:17:37] [INFO ] Flatten gal took : 329 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/graph263529497903382894.txt' '-o' '/tmp/graph263529497903382894.bin' '-w' '/tmp/graph263529497903382894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph263529497903382894.bin' '-l' '-1' '-v' '-w' '/tmp/graph263529497903382894.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:17:38] [INFO ] Decomposing Gal with order
[2022-05-17 18:17:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:17:42] [INFO ] Removed a total of 1979 redundant transitions.
[2022-05-17 18:17:43] [INFO ] Flatten gal took : 478 ms
[2022-05-17 18:18:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 6770 labels/synchronizations in 111 ms.
[2022-05-17 18:18:04] [INFO ] Time to serialize gal into /tmp/LTL8261614220759937637.gal : 46 ms
[2022-05-17 18:18:04] [INFO ] Time to serialize properties into /tmp/LTL11440156066031311898.ltl : 21 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/LTL8261614220759937637.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11440156066031311898.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/LTL8261614...246
Read 1 LTL properties
Checking formula 0 : !((!((G("(((((((((((((i82.i0.i0.i1.u1034.Think_1895>=1)&&(i82.i0.i0.i1.u1034.Fork_1895>=1))||((i15.i0.i1.i0.u317.Think_134>=1)&&(i15.i...287334
Formula 0 simplified : G"(((((((((((((i82.i0.i0.i1.u1034.Think_1895>=1)&&(i82.i0.i0.i1.u1034.Fork_1895>=1))||((i15.i0.i1.i0.u317.Think_134>=1)&&(i15.i0.i1....287318
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2235705794463246217
[2022-05-17 18:18:19] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2235705794463246217
Running compilation step : cd /tmp/ltsmin2235705794463246217;'/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/ltsmin2235705794463246217;'/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/ltsmin2235705794463246217;'/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-002000-LTLFireability-08 finished in 543038 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(p1)&&F(p1))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 173 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:18:22] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 18:18:23] [INFO ] Implicit Places using invariants in 809 ms returned []
Implicit Place search using SMT only with invariants took 811 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:18:23] [INFO ] Computed 4000 place invariants in 26 ms
[2022-05-17 18:18:24] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (GEQ s9166 1) (GEQ s9345 1) (GEQ s9605 1) (GEQ s9946 1) (GEQ s8126 1) (GEQ s8906 1) (GEQ s8305 1) (GEQ s8565 1) (GEQ s8727 1) (GEQ s9247 1) (GEQ s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Philosophers-COL-002000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-002000-LTLFireability-10 finished in 1969 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(p0) U p0) U X((X(G(p1))&&p0))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 314 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:18:24] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 18:18:25] [INFO ] Implicit Places using invariants in 890 ms returned []
Implicit Place search using SMT only with invariants took 891 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:18:25] [INFO ] Computed 4000 place invariants in 21 ms
[2022-05-17 18:18:26] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s1895 1) (GEQ s3895 1)) (AND (GEQ s134 1) (GEQ s2134 1)) (AND (GEQ s1288 1) (GEQ s3288 1)) (AND (GEQ s1298 1) (GEQ s3298 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 9614 ms.
Product exploration timeout after 91650 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
[2022-05-17 18:21:00] [WARNING] OOM error produced while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 295 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:21:00] [INFO ] Computed 4000 place invariants in 33 ms
[2022-05-17 18:21:01] [INFO ] Implicit Places using invariants in 883 ms returned []
Implicit Place search using SMT only with invariants took 884 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:21:01] [INFO ] Computed 4000 place invariants in 21 ms
[2022-05-17 18:21:02] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 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 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
[2022-05-17 18:22:51] [WARNING] OOM error produced while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 6 ms.
FORMULA Philosophers-COL-002000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-002000-LTLFireability-11 finished in 266732 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 379 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:22:51] [INFO ] Computed 4000 place invariants in 23 ms
[2022-05-17 18:22:52] [INFO ] Implicit Places using invariants in 958 ms returned []
Implicit Place search using SMT only with invariants took 959 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:22:52] [INFO ] Computed 4000 place invariants in 15 ms
[2022-05-17 18:22:53] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-12 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 (AND (GEQ s3666 1) (GEQ s5666 1)) (AND (GEQ s2482 1) (GEQ s4482 1)) (AND (GEQ s3079 1) (GEQ s5079 1)) (AND (GEQ s3069 1) (GEQ s5069 1)) (AND (GEQ s...], 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 15750 steps with 5262 reset in 10008 ms.
Product exploration timeout after 15500 steps with 5264 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)]
Knowledge based reduction with 1 factoid took 92 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 35 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2022-05-17 18:24:42] [WARNING] OOM error produced while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 448 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:24:43] [INFO ] Computed 4000 place invariants in 23 ms
[2022-05-17 18:24:44] [INFO ] Implicit Places using invariants in 1007 ms returned []
Implicit Place search using SMT only with invariants took 1008 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:24:44] [INFO ] Computed 4000 place invariants in 34 ms
[2022-05-17 18:24:45] [INFO ] Dead Transitions using invariants and state equation in 1025 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 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)]
Knowledge based reduction with 1 factoid took 79 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 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2022-05-17 18:26:20] [WARNING] OOM error produced while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration timeout after 13480 steps with 4444 reset in 10004 ms.
Product exploration timeout after 13150 steps with 4357 reset in 10013 ms.
Built C files in :
/tmp/ltsmin3139795618294763262
[2022-05-17 18:26:40] [INFO ] Too many transitions (10000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 18:26:40] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3139795618294763262
Running compilation step : cd /tmp/ltsmin3139795618294763262;'/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/ltsmin3139795618294763262;'/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/ltsmin3139795618294763262;'/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 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 460 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:26:44] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 18:26:45] [INFO ] Implicit Places using invariants in 891 ms returned []
Implicit Place search using SMT only with invariants took 896 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:26:45] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 18:26:45] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin9848162577604903577
[2022-05-17 18:26:46] [INFO ] Too many transitions (10000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 18:26:46] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9848162577604903577
Running compilation step : cd /tmp/ltsmin9848162577604903577;'/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/ltsmin9848162577604903577;'/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/ltsmin9848162577604903577;'/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 18:26:49] [INFO ] Flatten gal took : 295 ms
[2022-05-17 18:26:50] [INFO ] Flatten gal took : 307 ms
[2022-05-17 18:26:50] [INFO ] Time to serialize gal into /tmp/LTL15915165750552178151.gal : 30 ms
[2022-05-17 18:26:50] [INFO ] Time to serialize properties into /tmp/LTL7749314889372385242.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/LTL15915165750552178151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7749314889372385242.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/LTL1591516...267
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((((((Fork_1666>=1)&&(Catch1_1666>=1))||((Fork_482>=1)&&(Catch1_482>=1)))||(((Fork_1079>=1)&&(Catch1_1079>=1))||((Fork_...73810
Formula 0 simplified : !XF"(((((((((((((Fork_1666>=1)&&(Catch1_1666>=1))||((Fork_482>=1)&&(Catch1_482>=1)))||(((Fork_1079>=1)&&(Catch1_1079>=1))||((Fork_10...73804
Detected timeout of ITS tools.
[2022-05-17 18:27:05] [INFO ] Flatten gal took : 405 ms
[2022-05-17 18:27:05] [INFO ] Applying decomposition
[2022-05-17 18:27:06] [INFO ] Flatten gal took : 289 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/graph12928896101561538948.txt' '-o' '/tmp/graph12928896101561538948.bin' '-w' '/tmp/graph12928896101561538948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12928896101561538948.bin' '-l' '-1' '-v' '-w' '/tmp/graph12928896101561538948.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:27:06] [INFO ] Decomposing Gal with order
[2022-05-17 18:27:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:27:10] [INFO ] Removed a total of 1982 redundant transitions.
[2022-05-17 18:27:11] [INFO ] Flatten gal took : 429 ms
[2022-05-17 18:27:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 6742 labels/synchronizations in 96 ms.
[2022-05-17 18:27:20] [INFO ] Time to serialize gal into /tmp/LTL8677077967585113663.gal : 46 ms
[2022-05-17 18:27:20] [INFO ] Time to serialize properties into /tmp/LTL8773301301098220900.ltl : 10 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/LTL8677077967585113663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8773301301098220900.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/LTL8677077...245
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((((((i44.i1.i1.i2.u1859.Fork_1666>=1)&&(i44.i1.i1.i2.u1859.Catch1_1666>=1))||((i69.u1389.Fork_482>=1)&&(i69.u1389.Catc...143198
Formula 0 simplified : !XF"(((((((((((((i44.i1.i1.i2.u1859.Fork_1666>=1)&&(i44.i1.i1.i2.u1859.Catch1_1666>=1))||((i69.u1389.Fork_482>=1)&&(i69.u1389.Catch1...143192
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8670031366828768587
[2022-05-17 18:27:36] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8670031366828768587
Running compilation step : cd /tmp/ltsmin8670031366828768587;'/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/ltsmin8670031366828768587;'/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/ltsmin8670031366828768587;'/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-002000-LTLFireability-12 finished in 287914 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(!p1))||G((X(p2)&&p1))))'
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 665 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:27:39] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 18:27:40] [INFO ] Implicit Places using invariants in 859 ms returned []
Implicit Place search using SMT only with invariants took 859 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:27:40] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 18:27:41] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), p1, p1]
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 0}]], initial=1, aps=[p0:(OR (AND (GEQ s1895 1) (GEQ s3895 1)) (AND (GEQ s134 1) (GEQ s2134 1)) (AND (GEQ s1288 1) (GEQ s3288 1)) (AND (GEQ s1298 1) (GEQ s3298 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 80700 steps with 0 reset in 10002 ms.
Product exploration timeout after 74390 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p1)), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 412 ms. Reduced automaton from 7 states, 16 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 251 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (OR (NOT p1) (NOT p2)), p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3680 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5258 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5203 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 5105 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5175 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 5076 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5195 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5040 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5100 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4438 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Probabilistic random walk exhausted memory after 263385 steps, saw 263223 distinct states, run finished after 30759 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:29:28] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 18:31:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:31:01] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 768 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p1)), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 463 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 252 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (OR (NOT p1) (NOT p2)), p1, p1]
Stuttering acceptance computed with spot in 285 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (OR (NOT p1) (NOT p2)), p1, p1]
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 591 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:31:04] [INFO ] Computed 4000 place invariants in 24 ms
[2022-05-17 18:31:05] [INFO ] Implicit Places using invariants in 994 ms returned []
Implicit Place search using SMT only with invariants took 1002 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:31:05] [INFO ] Computed 4000 place invariants in 23 ms
[2022-05-17 18:31:06] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND p2 p1 p0)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 251 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3737 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5891 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5461 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 5263 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 5190 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5236 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 5246 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5257 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5123 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5208 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4432 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Probabilistic random walk exhausted memory after 263583 steps, saw 263421 distinct states, run finished after 29498 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:32:33] [INFO ] Computed 4000 place invariants in 28 ms
[2022-05-17 18:34:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:34:09] [INFO ] After 25036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 679 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND p2 p1 p0)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND p0 p1), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(AND p0 p1), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(AND p0 p1), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 9379 ms.
Product exploration timeout after 85990 steps with 0 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(AND p0 p1), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 716 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:34:31] [INFO ] Computed 4000 place invariants in 25 ms
[2022-05-17 18:34:32] [INFO ] Dead Transitions using invariants and state equation in 979 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Product exploration explored 100000 steps with 0 reset in 9939 ms.
Product exploration timeout after 86050 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin441610953033640479
[2022-05-17 18:34:52] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin441610953033640479
Running compilation step : cd /tmp/ltsmin441610953033640479;'/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/ltsmin441610953033640479;'/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/ltsmin441610953033640479;'/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 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 597 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:34:56] [INFO ] Computed 4000 place invariants in 28 ms
[2022-05-17 18:34:57] [INFO ] Implicit Places using invariants in 1010 ms returned []
Implicit Place search using SMT only with invariants took 1017 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:34:57] [INFO ] Computed 4000 place invariants in 25 ms
[2022-05-17 18:34:59] [INFO ] Dead Transitions using invariants and state equation in 1959 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin14437282157487083058
[2022-05-17 18:34:59] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14437282157487083058
Running compilation step : cd /tmp/ltsmin14437282157487083058;'/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/ltsmin14437282157487083058;'/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/ltsmin14437282157487083058;'/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 18:35:03] [INFO ] Flatten gal took : 394 ms
[2022-05-17 18:35:04] [INFO ] Flatten gal took : 420 ms
[2022-05-17 18:35:04] [INFO ] Time to serialize gal into /tmp/LTL17680845151073113567.gal : 29 ms
[2022-05-17 18:35:04] [INFO ] Time to serialize properties into /tmp/LTL4633915046665632218.ltl : 24 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/LTL17680845151073113567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4633915046665632218.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/LTL1768084...267
Read 1 LTL properties
Checking formula 0 : !(((("((((((((((((((Think_1895>=1)&&(Fork_1895>=1))||((Think_134>=1)&&(Fork_134>=1)))||(((Think_1288>=1)&&(Fork_1288>=1))||((Think_129...358947
Formula 0 simplified : !(("((((((((((((((Think_1895>=1)&&(Fork_1895>=1))||((Think_134>=1)&&(Fork_134>=1)))||(((Think_1288>=1)&&(Fork_1288>=1))||((Think_129...358935
Detected timeout of ITS tools.
[2022-05-17 18:35:19] [INFO ] Flatten gal took : 368 ms
[2022-05-17 18:35:19] [INFO ] Applying decomposition
[2022-05-17 18:35:20] [INFO ] Flatten gal took : 373 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/graph142525692689269868.txt' '-o' '/tmp/graph142525692689269868.bin' '-w' '/tmp/graph142525692689269868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph142525692689269868.bin' '-l' '-1' '-v' '-w' '/tmp/graph142525692689269868.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:35:21] [INFO ] Decomposing Gal with order
[2022-05-17 18:35:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:35:25] [INFO ] Removed a total of 1982 redundant transitions.
[2022-05-17 18:35:25] [INFO ] Flatten gal took : 594 ms
[2022-05-17 18:36:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 6662 labels/synchronizations in 97 ms.
[2022-05-17 18:36:14] [INFO ] Time to serialize gal into /tmp/LTL11562552721880590697.gal : 46 ms
[2022-05-17 18:36:14] [INFO ] Time to serialize properties into /tmp/LTL12529746333021361471.ltl : 49 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/LTL11562552721880590697.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12529746333021361471.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/LTL1156255...247
Read 1 LTL properties
Checking formula 0 : !(((("((((((((((((((i50.u1070.Think_1895>=1)&&(i50.u271.Fork_1895>=1))||((i19.i0.i1.i1.u1248.Think_134>=1)&&(i19.i0.i1.i1.u1248.Fork_1...708597
Formula 0 simplified : !(("((((((((((((((i50.u1070.Think_1895>=1)&&(i50.u271.Fork_1895>=1))||((i19.i0.i1.i1.u1248.Think_134>=1)&&(i19.i0.i1.i1.u1248.Fork_1...708585
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7938775863952997652
[2022-05-17 18:36:29] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7938775863952997652
Running compilation step : cd /tmp/ltsmin7938775863952997652;'/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/ltsmin7938775863952997652;'/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/ltsmin7938775863952997652;'/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-002000-LTLFireability-13 finished in 533295 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((G(X(G((X(p1)||p0)))) U !p2)))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 289 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:36:32] [INFO ] Computed 4000 place invariants in 27 ms
[2022-05-17 18:36:33] [INFO ] Implicit Places using invariants in 945 ms returned []
Implicit Place search using SMT only with invariants took 957 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:36:33] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 18:36:34] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 183 ms :[p2, p2, (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) p2)]
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=p2, acceptance={0, 1} source=0 dest: 1}], [{ cond=p2, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={1} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={1} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(OR (GEQ s9166 1) (GEQ s9345 1) (GEQ s9605 1) (GEQ s9946 1) (GEQ s8126 1) (GEQ s8906 1) (GEQ s8305 1) (GEQ s8565 1) (GEQ s8727 1) (GEQ s9247 1) (GEQ s8...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 8806 ms.
Stack based approach found an accepted trace after 33921 steps with 0 reset with depth 33922 and stack size 15244 in 4706 ms.
FORMULA Philosophers-COL-002000-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-002000-LTLFireability-15 finished in 15913 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X((X(p1)&&p0))))||F(!p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G((G(p1)&&p0))||X((X(!p1)&&p2))))))'
Found a SL insensitive property : Philosophers-COL-002000-LTLFireability-01
Stuttering acceptance computed with spot in 337 ms :[true, (OR (NOT p2) p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (OR (NOT p0) (NOT p1))]
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 652 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:36:49] [INFO ] Computed 4000 place invariants in 28 ms
[2022-05-17 18:36:50] [INFO ] Implicit Places using invariants in 975 ms returned []
Implicit Place search using SMT only with invariants took 979 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:36:50] [INFO ] Computed 4000 place invariants in 29 ms
[2022-05-17 18:36:51] [INFO ] Dead Transitions using invariants and state equation in 943 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Running random walk in product with property : Philosophers-COL-002000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND p1 (NOT p0))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}, { cond=(AND p1 p0), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p0), acceptance={} source=5 dest: 2}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=7 dest: 0}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}]], initial=4, aps=[p2:(OR (AND (GEQ s330 1) (GEQ s2329 1)) (AND (GEQ s917 1) (GEQ s2916 1)) (AND (GEQ s907 1) (GEQ s2906 1)) (AND (GEQ s927 1) (GEQ s2926 1)) (AND (GEQ s947 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 9441 ms.
Product exploration timeout after 93750 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 236 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4052 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5490 ms. (steps per millisecond=1 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5275 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5055 ms. (steps per millisecond=0 ) properties seen 0
Probabilistic random walk exhausted memory after 263899 steps, saw 263733 distinct states, run finished after 25594 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:37:57] [INFO ] Computed 4000 place invariants in 33 ms
[2022-05-17 18:38:23] [INFO ] [Real]Absence check using 4000 positive place invariants in 1816 ms returned sat
[2022-05-17 18:38:28] [INFO ] After 18043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 18:38:42] [INFO ] [Nat]Absence check using 4000 positive place invariants in 2427 ms returned sat
[2022-05-17 18:38:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:38:53] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 764 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 161 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 637 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:38:55] [INFO ] Computed 4000 place invariants in 41 ms
[2022-05-17 18:38:56] [INFO ] Implicit Places using invariants in 975 ms returned []
Implicit Place search using SMT only with invariants took 975 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:38:56] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 18:38:57] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3494 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4451 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5235 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5239 ms. (steps per millisecond=1 ) properties seen 0
Probabilistic random walk exhausted memory after 263783 steps, saw 263617 distinct states, run finished after 24622 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:39:41] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 18:40:06] [INFO ] [Real]Absence check using 4000 positive place invariants in 1760 ms returned sat
[2022-05-17 18:40:10] [INFO ] After 19119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 18:40:23] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1780 ms returned sat
[2022-05-17 18:40:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:40:36] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 656 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3513 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4492 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5284 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6003 steps, including 1 resets, run timeout after 5288 ms. (steps per millisecond=1 ) properties seen 0
Probabilistic random walk exhausted memory after 263847 steps, saw 263681 distinct states, run finished after 23638 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:41:19] [INFO ] Computed 4000 place invariants in 17 ms
[2022-05-17 18:41:43] [INFO ] [Real]Absence check using 4000 positive place invariants in 1505 ms returned sat
[2022-05-17 18:41:48] [INFO ] After 17917ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 18:42:04] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1520 ms returned sat
[2022-05-17 18:42:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:42:13] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 704 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 628 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:42:14] [INFO ] Computed 4000 place invariants in 27 ms
[2022-05-17 18:42:15] [INFO ] Implicit Places using invariants in 914 ms returned []
Implicit Place search using SMT only with invariants took 917 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:42:15] [INFO ] Computed 4000 place invariants in 21 ms
[2022-05-17 18:42:16] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Knowledge obtained : [(AND p2 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 168 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 172 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 0 reset in 9492 ms.
Product exploration timeout after 92030 steps with 0 reset in 10001 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 175 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 645 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:42:37] [INFO ] Computed 4000 place invariants in 27 ms
[2022-05-17 18:42:38] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Product exploration explored 100000 steps with 0 reset in 9296 ms.
Product exploration timeout after 91940 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin8368851735171647288
[2022-05-17 18:42:58] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8368851735171647288
Running compilation step : cd /tmp/ltsmin8368851735171647288;'/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/ltsmin8368851735171647288;'/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/ltsmin8368851735171647288;'/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 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 580 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:43:01] [INFO ] Computed 4000 place invariants in 24 ms
[2022-05-17 18:43:02] [INFO ] Implicit Places using invariants in 875 ms returned []
Implicit Place search using SMT only with invariants took 894 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 18:43:02] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 18:43:03] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin3400677182739705767
[2022-05-17 18:43:03] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3400677182739705767
Running compilation step : cd /tmp/ltsmin3400677182739705767;'/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/ltsmin3400677182739705767;'/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/ltsmin3400677182739705767;'/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 18:43:07] [INFO ] Flatten gal took : 335 ms
[2022-05-17 18:43:08] [INFO ] Flatten gal took : 360 ms
[2022-05-17 18:43:08] [INFO ] Time to serialize gal into /tmp/LTL16027477990362038984.gal : 31 ms
[2022-05-17 18:43:08] [INFO ] Time to serialize properties into /tmp/LTL14159345280164990072.ltl : 21 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/LTL16027477990362038984.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14159345280164990072.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/LTL1602747...268
Read 1 LTL properties
Checking formula 0 : !((G(X((G((((((((((((G("(((((((((((((Think_1895<1)||(Fork_1895<1))&&((Think_134<1)||(Fork_134<1)))&&(((Think_1288<1)||(Fork_1288<1))&&...279214
Formula 0 simplified : !GX(G("((((((((((((Think_385<1)||(Fork_384<1))&&((Think_842<1)||(Fork_841<1)))&&(((Think_882<1)||(Fork_881<1))&&((Think_235<1)||(For...279167
Detected timeout of ITS tools.
[2022-05-17 18:43:23] [INFO ] Flatten gal took : 403 ms
[2022-05-17 18:43:23] [INFO ] Applying decomposition
[2022-05-17 18:43:24] [INFO ] Flatten gal took : 406 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/graph1318311911027162116.txt' '-o' '/tmp/graph1318311911027162116.bin' '-w' '/tmp/graph1318311911027162116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1318311911027162116.bin' '-l' '-1' '-v' '-w' '/tmp/graph1318311911027162116.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:43:25] [INFO ] Decomposing Gal with order
[2022-05-17 18:43:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:43:29] [INFO ] Removed a total of 1977 redundant transitions.
[2022-05-17 18:43:30] [INFO ] Flatten gal took : 635 ms
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-002000"
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-002000, 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-165277016400244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-002000.tgz
mv Philosophers-COL-002000 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 ;