About the Execution of ITS-Tools for CircularTrains-PT-768
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.119 | 3600000.00 | 3918952.00 | 413778.70 | FFFFFTFF?FFF???F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251919000764.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 CircularTrains-PT-768, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251919000764
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 8.2K Apr 30 07:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 07:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 07:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 07:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 591K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CircularTrains-PT-768-LTLFireability-00
FORMULA_NAME CircularTrains-PT-768-LTLFireability-01
FORMULA_NAME CircularTrains-PT-768-LTLFireability-02
FORMULA_NAME CircularTrains-PT-768-LTLFireability-03
FORMULA_NAME CircularTrains-PT-768-LTLFireability-04
FORMULA_NAME CircularTrains-PT-768-LTLFireability-05
FORMULA_NAME CircularTrains-PT-768-LTLFireability-06
FORMULA_NAME CircularTrains-PT-768-LTLFireability-07
FORMULA_NAME CircularTrains-PT-768-LTLFireability-08
FORMULA_NAME CircularTrains-PT-768-LTLFireability-09
FORMULA_NAME CircularTrains-PT-768-LTLFireability-10
FORMULA_NAME CircularTrains-PT-768-LTLFireability-11
FORMULA_NAME CircularTrains-PT-768-LTLFireability-12
FORMULA_NAME CircularTrains-PT-768-LTLFireability-13
FORMULA_NAME CircularTrains-PT-768-LTLFireability-14
FORMULA_NAME CircularTrains-PT-768-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652688356676
Running Version 202205111006
[2022-05-16 08:05:57] [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-16 08:05:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 08:05:58] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2022-05-16 08:05:58] [INFO ] Transformed 1536 places.
[2022-05-16 08:05:58] [INFO ] Transformed 768 transitions.
[2022-05-16 08:05:58] [INFO ] Parsed PT model containing 1536 places and 768 transitions in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-768-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 1536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1536/1536 places, 768/768 transitions.
Applied a total of 0 rules in 154 ms. Remains 1536 /1536 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1536 cols
[2022-05-16 08:05:58] [INFO ] Computed 769 place invariants in 106 ms
[2022-05-16 08:05:59] [INFO ] Implicit Places using invariants in 1545 ms returned [14, 18, 29, 35, 45, 47, 59, 75, 79, 81, 83, 85, 90, 94, 96, 102, 106, 110, 111, 125, 128, 138, 144, 149, 150, 152, 155, 158, 163, 173, 180, 187, 193, 196, 197, 198, 224, 228, 243, 244, 248, 255, 259, 273, 276, 296, 312, 318, 325, 330, 333, 339, 350, 353, 355, 361, 368, 380, 381, 402, 414, 419, 420, 421, 438, 451, 453, 463, 464, 471, 473, 480, 499, 509, 516, 519, 530, 531, 533, 535, 544, 549, 557, 558, 561, 577, 578, 580, 600, 606, 612, 622, 630, 633, 656, 658, 661, 662, 665, 666, 669, 671, 677, 679, 681, 688, 689, 693, 694, 696, 697, 699, 705, 709, 711, 715, 716, 725, 732, 750, 761, 767, 770, 776, 780, 793, 804, 807, 810, 811, 817, 820, 843, 846, 856, 872, 874, 883, 884, 885, 887, 905, 929, 934, 940, 942, 943, 948, 952, 953, 970, 973, 975, 977, 991, 997, 1005, 1009, 1013, 1017, 1018, 1019, 1020, 1042, 1046, 1059, 1071, 1072, 1073, 1078, 1079, 1087, 1088, 1094, 1096, 1101, 1121, 1128, 1131, 1147, 1150, 1153, 1157, 1160, 1163, 1168, 1178, 1182, 1185, 1198, 1204, 1209, 1211, 1216, 1228, 1229, 1244, 1247, 1252, 1261, 1262, 1266, 1273, 1292, 1299, 1300, 1305, 1306, 1329, 1335, 1337, 1338, 1339, 1350, 1354, 1356, 1360, 1362, 1373, 1378, 1379, 1385, 1391, 1409, 1430, 1438, 1446, 1450, 1453, 1461, 1472, 1476, 1484, 1485, 1487, 1488, 1493, 1495, 1507, 1512, 1513, 1515, 1517, 1525, 1527]
Discarding 245 places :
Implicit Place search using SMT only with invariants took 1578 ms to find 245 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1291/1536 places, 768/768 transitions.
Applied a total of 0 rules in 127 ms. Remains 1291 /1291 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1291/1536 places, 768/768 transitions.
Support contains 64 out of 1291 places after structural reductions.
[2022-05-16 08:06:00] [INFO ] Flatten gal took : 96 ms
[2022-05-16 08:06:00] [INFO ] Flatten gal took : 57 ms
[2022-05-16 08:06:00] [INFO ] Input system was already deterministic with 768 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 31) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 768 rows 1291 cols
[2022-05-16 08:06:01] [INFO ] Computed 524 place invariants in 46 ms
[2022-05-16 08:06:01] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
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' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 1291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 232 place count 1291 transition count 536
Reduce places removed 232 places and 0 transitions.
Iterating post reduction 1 with 232 rules applied. Total rules applied 464 place count 1059 transition count 536
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 464 place count 1059 transition count 524
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 488 place count 1047 transition count 524
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 510 place count 1036 transition count 513
Applied a total of 510 rules in 125 ms. Remains 1036 /1291 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1036 cols
[2022-05-16 08:06:01] [INFO ] Computed 524 place invariants in 5 ms
[2022-05-16 08:06:02] [INFO ] Implicit Places using invariants in 724 ms returned [166, 167, 205, 265, 279, 566, 782, 871, 1012, 1032]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 726 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1291 places, 513/768 transitions.
Applied a total of 0 rules in 37 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1026/1291 places, 513/768 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s807 1)), p1:(OR (LT s72 1) (LT s977 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 2777 ms.
Product exploration explored 100000 steps with 0 reset in 3059 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 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 253 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:06:09] [INFO ] Computed 514 place invariants in 6 ms
[2022-05-16 08:06:10] [INFO ] [Real]Absence check using 512 positive place invariants in 281 ms returned sat
[2022-05-16 08:06:10] [INFO ] [Real]Absence check using 512 positive and 2 generalized place invariants in 78 ms returned sat
[2022-05-16 08:06:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:06:14] [INFO ] [Real]Absence check using state equation in 3847 ms returned sat
[2022-05-16 08:06:14] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-16 08:06:24] [INFO ] Added : 254 causal constraints over 51 iterations in 10288 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 4 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 37 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:06:24] [INFO ] Computed 514 place invariants in 14 ms
[2022-05-16 08:06:25] [INFO ] Implicit Places using invariants in 699 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:06:25] [INFO ] Computed 514 place invariants in 8 ms
[2022-05-16 08:06:26] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2022-05-16 08:06:26] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:06:26] [INFO ] Computed 514 place invariants in 10 ms
[2022-05-16 08:06:26] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1026/1026 places, 513/513 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 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 409 steps, including 0 resets, run visited all 2 properties in 22 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 215 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:06:28] [INFO ] Computed 514 place invariants in 13 ms
[2022-05-16 08:06:28] [INFO ] [Real]Absence check using 512 positive place invariants in 297 ms returned sat
[2022-05-16 08:06:28] [INFO ] [Real]Absence check using 512 positive and 2 generalized place invariants in 79 ms returned sat
[2022-05-16 08:06:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:06:32] [INFO ] [Real]Absence check using state equation in 3816 ms returned sat
[2022-05-16 08:06:32] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-16 08:06:43] [INFO ] Added : 254 causal constraints over 51 iterations in 10330 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2607 ms.
Product exploration explored 100000 steps with 0 reset in 3041 ms.
Built C files in :
/tmp/ltsmin5669579831086045737
[2022-05-16 08:06:49] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2022-05-16 08:06:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:06:49] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2022-05-16 08:06:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:06:49] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2022-05-16 08:06:49] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:06:49] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5669579831086045737
Running compilation step : cd /tmp/ltsmin5669579831086045737;'/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'
Compilation finished in 1304 ms.
Running link step : cd /tmp/ltsmin5669579831086045737;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin5669579831086045737;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15449595549146773727.hoa' '--buchi-type=spotba'
LTSmin run took 7241 ms.
FORMULA CircularTrains-PT-768-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLFireability-00 finished in 56110 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p0)&&G(p0)))&&p1)))'
Support contains 4 out of 1291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Applied a total of 0 rules in 48 ms. Remains 1291 /1291 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1291 cols
[2022-05-16 08:06:57] [INFO ] Computed 524 place invariants in 16 ms
[2022-05-16 08:06:58] [INFO ] Implicit Places using invariants in 740 ms returned [3, 207, 209, 330, 349, 707, 978, 1095, 1259, 1286]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 742 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1291 places, 768/768 transitions.
Applied a total of 0 rules in 45 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1281/1291 places, 768/768 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s255 1) (GEQ s611 1)), p1:(OR (AND (GEQ s808 1) (GEQ s1164 1)) (AND (GEQ s255 1) (GEQ s611 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-768-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLFireability-01 finished in 955 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 4 out of 1291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Applied a total of 0 rules in 42 ms. Remains 1291 /1291 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1291 cols
[2022-05-16 08:06:58] [INFO ] Computed 524 place invariants in 13 ms
[2022-05-16 08:06:59] [INFO ] Implicit Places using invariants in 767 ms returned [3, 207, 209, 258, 330, 349, 707, 978, 1095, 1259, 1286]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 768 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1291 places, 768/768 transitions.
Applied a total of 0 rules in 38 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1280/1291 places, 768/768 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s14 1) (LT s220 1) (AND (GEQ s33 1) (GEQ s1040 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-768-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLFireability-02 finished in 954 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F(p1)))))'
Support contains 4 out of 1291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Applied a total of 0 rules in 40 ms. Remains 1291 /1291 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1291 cols
[2022-05-16 08:06:59] [INFO ] Computed 524 place invariants in 12 ms
[2022-05-16 08:07:00] [INFO ] Implicit Places using invariants in 746 ms returned [3, 207, 209, 258, 330, 349, 707, 978, 1259, 1286]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 750 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1291 places, 768/768 transitions.
Applied a total of 0 rules in 37 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1281/1291 places, 768/768 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s25 1) (GEQ s106 1)), p1:(AND (GEQ s875 1) (GEQ s1087 1))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CircularTrains-PT-768-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLFireability-03 finished in 1005 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 4 out of 1291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Applied a total of 0 rules in 41 ms. Remains 1291 /1291 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1291 cols
[2022-05-16 08:07:00] [INFO ] Computed 524 place invariants in 14 ms
[2022-05-16 08:07:01] [INFO ] Implicit Places using invariants in 767 ms returned [3, 207, 258, 330, 349, 707, 978, 1095, 1259, 1286]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 770 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1291 places, 768/768 transitions.
Applied a total of 0 rules in 38 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1281/1291 places, 768/768 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s205 1) (LT s207 1)), p0:(AND (GEQ s1086 1) (GEQ s1279 1))], nbAcceptance=0, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-768-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLFireability-04 finished in 984 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G((G(p0)||p1))))))'
Support contains 4 out of 1291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Drop transitions removed 231 transitions
Trivial Post-agglo rules discarded 231 transitions
Performed 231 trivial Post agglomeration. Transition count delta: 231
Iterating post reduction 0 with 231 rules applied. Total rules applied 231 place count 1291 transition count 537
Reduce places removed 231 places and 0 transitions.
Iterating post reduction 1 with 231 rules applied. Total rules applied 462 place count 1060 transition count 537
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 462 place count 1060 transition count 523
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 490 place count 1046 transition count 523
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 512 place count 1035 transition count 512
Applied a total of 512 rules in 89 ms. Remains 1035 /1291 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1035 cols
[2022-05-16 08:07:01] [INFO ] Computed 524 place invariants in 12 ms
[2022-05-16 08:07:02] [INFO ] Implicit Places using invariants in 675 ms returned [2, 166, 167, 205, 265, 279, 566, 782, 870, 1011, 1031]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 676 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1291 places, 512/768 transitions.
Applied a total of 0 rules in 35 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1024/1291 places, 512/768 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s282 1) (GEQ s1004 1)), p1:(AND (GEQ s284 1) (GEQ s981 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2769 ms.
Product exploration explored 100000 steps with 0 reset in 3085 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) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 290 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1747 steps, including 0 resets, run visited all 4 properties in 69 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 369 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 08:07:09] [INFO ] Computed 513 place invariants in 5 ms
[2022-05-16 08:07:10] [INFO ] [Real]Absence check using 511 positive place invariants in 286 ms returned sat
[2022-05-16 08:07:10] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 64 ms returned sat
[2022-05-16 08:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:07:13] [INFO ] [Real]Absence check using state equation in 2645 ms returned sat
[2022-05-16 08:07:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 08:07:13] [INFO ] [Nat]Absence check using 511 positive place invariants in 300 ms returned sat
[2022-05-16 08:07:13] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 52 ms returned sat
[2022-05-16 08:07:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 08:07:15] [INFO ] [Nat]Absence check using state equation in 1965 ms returned sat
[2022-05-16 08:07:15] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-16 08:07:18] [INFO ] Added : 254 causal constraints over 51 iterations in 2899 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 31 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 08:07:18] [INFO ] Computed 513 place invariants in 13 ms
[2022-05-16 08:07:19] [INFO ] Implicit Places using invariants in 674 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 08:07:19] [INFO ] Computed 513 place invariants in 6 ms
[2022-05-16 08:07:20] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
[2022-05-16 08:07:20] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 08:07:20] [INFO ] Computed 513 place invariants in 12 ms
[2022-05-16 08:07:20] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 512/512 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) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1687 steps, including 0 resets, run visited all 4 properties in 61 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 390 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 08:07:22] [INFO ] Computed 513 place invariants in 6 ms
[2022-05-16 08:07:22] [INFO ] [Real]Absence check using 511 positive place invariants in 288 ms returned sat
[2022-05-16 08:07:22] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 64 ms returned sat
[2022-05-16 08:07:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:07:25] [INFO ] [Real]Absence check using state equation in 2652 ms returned sat
[2022-05-16 08:07:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 08:07:26] [INFO ] [Nat]Absence check using 511 positive place invariants in 280 ms returned sat
[2022-05-16 08:07:26] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 51 ms returned sat
[2022-05-16 08:07:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 08:07:28] [INFO ] [Nat]Absence check using state equation in 1916 ms returned sat
[2022-05-16 08:07:28] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-16 08:07:31] [INFO ] Added : 254 causal constraints over 51 iterations in 2892 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 2739 ms.
Product exploration explored 100000 steps with 0 reset in 3083 ms.
Built C files in :
/tmp/ltsmin14597770585769532234
[2022-05-16 08:07:37] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-16 08:07:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:07:37] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-16 08:07:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:07:37] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-16 08:07:37] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:07:37] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14597770585769532234
Running compilation step : cd /tmp/ltsmin14597770585769532234;'/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'
Compilation finished in 1242 ms.
Running link step : cd /tmp/ltsmin14597770585769532234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14597770585769532234;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1202700718080950400.hoa' '--buchi-type=spotba'
LTSmin run took 5380 ms.
FORMULA CircularTrains-PT-768-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLFireability-06 finished in 42211 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!(F(p1) U p2))&&F(p1)&&p0))))'
Support contains 6 out of 1291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Applied a total of 0 rules in 40 ms. Remains 1291 /1291 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1291 cols
[2022-05-16 08:07:43] [INFO ] Computed 524 place invariants in 17 ms
[2022-05-16 08:07:44] [INFO ] Implicit Places using invariants in 756 ms returned [3, 207, 209, 258, 330, 349, 978, 1095, 1259, 1286]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 758 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1291 places, 768/768 transitions.
Applied a total of 0 rules in 39 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1281/1291 places, 768/768 transitions.
Stuttering acceptance computed with spot in 208 ms :[p2, (OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) (NOT p0) p2), true, (OR (NOT p1) (NOT p0) p2)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p2:(AND (GEQ s641 1) (GEQ s990 1)), p1:(AND (GEQ s880 1) (GEQ s1214 1)), p0:(AND (GEQ s701 1) (GEQ s1252 1))], 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-768-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLFireability-07 finished in 1088 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&p1)))'
Support contains 4 out of 1291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Applied a total of 0 rules in 35 ms. Remains 1291 /1291 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1291 cols
[2022-05-16 08:07:44] [INFO ] Computed 524 place invariants in 17 ms
[2022-05-16 08:07:45] [INFO ] Implicit Places using invariants in 747 ms returned [3, 207, 209, 258, 330, 349, 707, 978, 1095, 1259]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 748 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1291 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1281/1291 places, 768/768 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s313 1) (LT s534 1)), p0:(OR (LT s415 1) (LT s1276 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 33571 reset in 3876 ms.
Product exploration explored 100000 steps with 35133 reset in 4085 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), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Finished random walk after 68 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1281 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Applied a total of 0 rules in 39 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:07:54] [INFO ] Computed 514 place invariants in 13 ms
[2022-05-16 08:07:55] [INFO ] Implicit Places using invariants in 746 ms returned []
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:07:55] [INFO ] Computed 514 place invariants in 7 ms
[2022-05-16 08:07:56] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:07:56] [INFO ] Computed 514 place invariants in 15 ms
[2022-05-16 08:07:57] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1281/1281 places, 768/768 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Finished random walk after 282 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=23 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 35665 reset in 3903 ms.
Product exploration explored 100000 steps with 34585 reset in 4072 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 254 rules applied. Total rules applied 254 place count 1281 transition count 768
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 255 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 255 place count 1281 transition count 768
Deduced a syphon composed of 255 places in 0 ms
Applied a total of 255 rules in 213 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2022-05-16 08:08:06] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:08:06] [INFO ] Computed 514 place invariants in 12 ms
[2022-05-16 08:08:07] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1281/1281 places, 768/768 transitions.
Finished structural reductions, in 1 iterations. Remains : 1281/1281 places, 768/768 transitions.
Product exploration explored 100000 steps with 36730 reset in 9817 ms.
Product exploration explored 100000 steps with 36311 reset in 9900 ms.
Built C files in :
/tmp/ltsmin10901110696372428561
[2022-05-16 08:08:26] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10901110696372428561
Running compilation step : cd /tmp/ltsmin10901110696372428561;'/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'
Compilation finished in 1357 ms.
Running link step : cd /tmp/ltsmin10901110696372428561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10901110696372428561;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4008830328372909568.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Applied a total of 0 rules in 44 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:08:42] [INFO ] Computed 514 place invariants in 10 ms
[2022-05-16 08:08:42] [INFO ] Implicit Places using invariants in 728 ms returned []
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:08:42] [INFO ] Computed 514 place invariants in 7 ms
[2022-05-16 08:08:43] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1887 ms to find 0 implicit places.
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:08:43] [INFO ] Computed 514 place invariants in 11 ms
[2022-05-16 08:08:44] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1281/1281 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin14340892733144134200
[2022-05-16 08:08:44] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14340892733144134200
Running compilation step : cd /tmp/ltsmin14340892733144134200;'/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'
Compilation finished in 1334 ms.
Running link step : cd /tmp/ltsmin14340892733144134200;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14340892733144134200;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10236604939402496284.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 08:08:59] [INFO ] Flatten gal took : 41 ms
[2022-05-16 08:08:59] [INFO ] Flatten gal took : 42 ms
[2022-05-16 08:08:59] [INFO ] Time to serialize gal into /tmp/LTL13486453997088973746.gal : 7 ms
[2022-05-16 08:08:59] [INFO ] Time to serialize properties into /tmp/LTL17920502543370202260.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13486453997088973746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17920502543370202260.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/LTL1348645...268
Read 1 LTL properties
Checking formula 0 : !((F((X(F("((Section_613<1)||(F614<1))")))&&("((Section_677<1)||(F678<1))"))))
Formula 0 simplified : !F("((Section_677<1)||(F678<1))" & XF"((Section_613<1)||(F614<1))")
Detected timeout of ITS tools.
[2022-05-16 08:09:14] [INFO ] Flatten gal took : 38 ms
[2022-05-16 08:09:14] [INFO ] Applying decomposition
[2022-05-16 08:09:14] [INFO ] Flatten gal took : 34 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/graph12585123900853872691.txt' '-o' '/tmp/graph12585123900853872691.bin' '-w' '/tmp/graph12585123900853872691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12585123900853872691.bin' '-l' '-1' '-v' '-w' '/tmp/graph12585123900853872691.weights' '-q' '0' '-e' '0.001'
[2022-05-16 08:09:14] [INFO ] Decomposing Gal with order
[2022-05-16 08:09:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 08:09:15] [INFO ] Flatten gal took : 74 ms
[2022-05-16 08:09:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-16 08:09:15] [INFO ] Time to serialize gal into /tmp/LTL9707500795083075965.gal : 9 ms
[2022-05-16 08:09:15] [INFO ] Time to serialize properties into /tmp/LTL9061114536273748606.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9707500795083075965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9061114536273748606.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/LTL9707500...245
Read 1 LTL properties
Checking formula 0 : !((F((X(F("((i38.i1.i0.u102.Section_613<1)||(i38.i1.i0.u102.F614<1))")))&&("((i27.u23.Section_677<1)||(i27.u130.F678<1))"))))
Formula 0 simplified : !F("((i27.u23.Section_677<1)||(i27.u130.F678<1))" & XF"((i38.i1.i0.u102.Section_613<1)||(i38.i1.i0.u102.F614<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11279056285398916736
[2022-05-16 08:09:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11279056285398916736
Running compilation step : cd /tmp/ltsmin11279056285398916736;'/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'
Compilation finished in 1319 ms.
Running link step : cd /tmp/ltsmin11279056285398916736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11279056285398916736;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(<>((LTLAPp0==true)))&&(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-768-LTLFireability-08 finished in 120449 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(!(!p1 U p1))))'
Support contains 4 out of 1291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Applied a total of 0 rules in 45 ms. Remains 1291 /1291 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1291 cols
[2022-05-16 08:09:45] [INFO ] Computed 524 place invariants in 16 ms
[2022-05-16 08:09:46] [INFO ] Implicit Places using invariants in 744 ms returned [3, 207, 209, 258, 330, 349, 707, 978, 1095, 1259, 1286]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 746 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1291 places, 768/768 transitions.
Applied a total of 0 rules in 37 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1280/1291 places, 768/768 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s57 1) (GEQ s412 1)), p1:(AND (GEQ s144 1) (GEQ s1072 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1006 steps with 0 reset in 34 ms.
FORMULA CircularTrains-PT-768-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLFireability-10 finished in 1032 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U !X((p0 U p1)))||X(G(X(p2)))))'
Support contains 6 out of 1291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Applied a total of 0 rules in 41 ms. Remains 1291 /1291 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1291 cols
[2022-05-16 08:09:46] [INFO ] Computed 524 place invariants in 14 ms
[2022-05-16 08:09:47] [INFO ] Implicit Places using invariants in 740 ms returned [3, 207, 209, 258, 330, 707, 978, 1095, 1259, 1286]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 742 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1291 places, 768/768 transitions.
Applied a total of 0 rules in 39 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1281/1291 places, 768/768 transitions.
Stuttering acceptance computed with spot in 317 ms :[true, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}, { cond=p0, acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 3}, { cond=p0, acceptance={} source=7 dest: 5}], [{ cond=p1, acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s19 1) (GEQ s382 1)), p1:(AND (GEQ s173 1) (GEQ s264 1)), p2:(AND (GEQ s19 1) (GEQ s382 1) (GEQ s344 1) (GEQ s994 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1657 steps with 5 reset in 63 ms.
FORMULA CircularTrains-PT-768-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLFireability-11 finished in 1231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U !(G(X(X((X(!p1)||p2)))) U p2)))'
Support contains 6 out of 1291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Applied a total of 0 rules in 39 ms. Remains 1291 /1291 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1291 cols
[2022-05-16 08:09:47] [INFO ] Computed 524 place invariants in 12 ms
[2022-05-16 08:09:48] [INFO ] Implicit Places using invariants in 739 ms returned [3, 209, 258, 330, 349, 707, 1095, 1259, 1286]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 747 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1282/1291 places, 768/768 transitions.
Applied a total of 0 rules in 35 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1282/1291 places, 768/768 transitions.
Stuttering acceptance computed with spot in 340 ms :[p2, true, p2, p2, (OR (NOT p1) p2), p2, (NOT p1), p2, (AND p2 (NOT p1)), (AND (NOT p1) p2)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=p2, acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 6}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 8}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 p0), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 9}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 8}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s206 1) (GEQ s1044 1)), p0:(AND (GEQ s206 1) (GEQ s1044 1) (GEQ s72 1) (GEQ s972 1)), p1:(OR (LT s87 1) (LT s1221 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18258 reset in 4255 ms.
Product exploration explored 100000 steps with 17935 reset in 4452 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 p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), true, (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge based reduction with 6 factoid took 562 ms. Reduced automaton from 10 states, 26 edges and 3 AP to 7 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 239 ms :[p2, p2, (OR (NOT p1) p2), (NOT p1), p2, (AND p2 (NOT p1)), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 768 rows 1282 cols
[2022-05-16 08:09:59] [INFO ] Computed 515 place invariants in 15 ms
[2022-05-16 08:09:59] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), true, (X (X (NOT (AND (NOT p2) p0)))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND (NOT p1) p0 (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F (AND (NOT p0) p2)), (F (AND p0 p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND (NOT p1) p0 p2))]
Knowledge based reduction with 8 factoid took 868 ms. Reduced automaton from 7 states, 16 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 238 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), (OR (NOT p1) p2), (NOT p1), (OR p2 (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 250 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), (OR (NOT p1) p2), (NOT p1), (OR p2 (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))]
Support contains 6 out of 1282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Applied a total of 0 rules in 35 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1282 cols
[2022-05-16 08:10:00] [INFO ] Computed 515 place invariants in 11 ms
[2022-05-16 08:10:01] [INFO ] Implicit Places using invariants in 732 ms returned []
// Phase 1: matrix 768 rows 1282 cols
[2022-05-16 08:10:01] [INFO ] Computed 515 place invariants in 6 ms
[2022-05-16 08:10:02] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
// Phase 1: matrix 768 rows 1282 cols
[2022-05-16 08:10:02] [INFO ] Computed 515 place invariants in 10 ms
[2022-05-16 08:10:03] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1282/1282 places, 768/768 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 p2) p1 (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 227 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), (OR (NOT p1) p2), (NOT p1), (OR p2 (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))]
Finished random walk after 2676 steps, including 0 resets, run visited all 7 properties in 146 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (F (AND (NOT p0) p2)), (F p0), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 1 factoid took 337 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 226 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), (OR (NOT p1) p2), (NOT p1), (OR p2 (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 250 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), (OR (NOT p1) p2), (NOT p1), (OR p2 (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 231 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), (OR (NOT p1) p2), (NOT p1), (OR p2 (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))]
Product exploration explored 100000 steps with 17388 reset in 4192 ms.
Product exploration explored 100000 steps with 17015 reset in 4381 ms.
Built C files in :
/tmp/ltsmin14482692880294287191
[2022-05-16 08:10:14] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14482692880294287191
Running compilation step : cd /tmp/ltsmin14482692880294287191;'/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'
Compilation finished in 1362 ms.
Running link step : cd /tmp/ltsmin14482692880294287191;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14482692880294287191;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12790492427667053529.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Applied a total of 0 rules in 46 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1282 cols
[2022-05-16 08:10:29] [INFO ] Computed 515 place invariants in 11 ms
[2022-05-16 08:10:29] [INFO ] Implicit Places using invariants in 720 ms returned []
// Phase 1: matrix 768 rows 1282 cols
[2022-05-16 08:10:29] [INFO ] Computed 515 place invariants in 18 ms
[2022-05-16 08:10:31] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1863 ms to find 0 implicit places.
// Phase 1: matrix 768 rows 1282 cols
[2022-05-16 08:10:31] [INFO ] Computed 515 place invariants in 12 ms
[2022-05-16 08:10:31] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1282/1282 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin17205948185578132927
[2022-05-16 08:10:31] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17205948185578132927
Running compilation step : cd /tmp/ltsmin17205948185578132927;'/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'
Compilation finished in 1308 ms.
Running link step : cd /tmp/ltsmin17205948185578132927;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17205948185578132927;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4091848800565828396.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 08:10:46] [INFO ] Flatten gal took : 33 ms
[2022-05-16 08:10:46] [INFO ] Flatten gal took : 28 ms
[2022-05-16 08:10:46] [INFO ] Time to serialize gal into /tmp/LTL4423598179818667816.gal : 3 ms
[2022-05-16 08:10:46] [INFO ] Time to serialize properties into /tmp/LTL13586780388275689371.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4423598179818667816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13586780388275689371.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/LTL4423598...267
Read 1 LTL properties
Checking formula 0 : !(((!("(((F668>=1)&&(Section_667>=1))&&((Section_64>=1)&&(F65>=1)))"))U(!((G(X(X((X(!("((F87<1)||(Section_86<1))")))||("((F668>=1)&&(S...214
Formula 0 simplified : !(!"(((F668>=1)&&(Section_667>=1))&&((Section_64>=1)&&(F65>=1)))" U !(GXX("((F668>=1)&&(Section_667>=1))" | X!"((F87<1)||(Section_86...197
Detected timeout of ITS tools.
[2022-05-16 08:11:01] [INFO ] Flatten gal took : 26 ms
[2022-05-16 08:11:01] [INFO ] Applying decomposition
[2022-05-16 08:11:01] [INFO ] Flatten gal took : 27 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/graph17627437534663310838.txt' '-o' '/tmp/graph17627437534663310838.bin' '-w' '/tmp/graph17627437534663310838.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17627437534663310838.bin' '-l' '-1' '-v' '-w' '/tmp/graph17627437534663310838.weights' '-q' '0' '-e' '0.001'
[2022-05-16 08:11:01] [INFO ] Decomposing Gal with order
[2022-05-16 08:11:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 08:11:01] [INFO ] Flatten gal took : 35 ms
[2022-05-16 08:11:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-16 08:11:02] [INFO ] Time to serialize gal into /tmp/LTL15223593365903687707.gal : 6 ms
[2022-05-16 08:11:02] [INFO ] Time to serialize properties into /tmp/LTL14907957181576909232.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15223593365903687707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14907957181576909232.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/LTL1522359...247
Read 1 LTL properties
Checking formula 0 : !(((!("(((i1.i0.i1.u225.F668>=1)&&(i1.i0.i1.u225.Section_667>=1))&&((i30.u109.Section_64>=1)&&(i30.u125.F65>=1)))"))U(!((G(X(X((X(!("(...334
Formula 0 simplified : !(!"(((i1.i0.i1.u225.F668>=1)&&(i1.i0.i1.u225.Section_667>=1))&&((i30.u109.Section_64>=1)&&(i30.u125.F65>=1)))" U !(GXX("((i1.i0.i1....317
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15569467522997436519
[2022-05-16 08:11:17] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15569467522997436519
Running compilation step : cd /tmp/ltsmin15569467522997436519;'/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'
Compilation finished in 1336 ms.
Running link step : cd /tmp/ltsmin15569467522997436519;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15569467522997436519;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(LTLAPp0==true) U !([](X(X((X(!(LTLAPp1==true))||(LTLAPp2==true))))) U (LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-768-LTLFireability-12 finished in 104544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)||X(p1)))&&F(X(G(F(G(p2))))))))'
Support contains 6 out of 1291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Applied a total of 0 rules in 41 ms. Remains 1291 /1291 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1291 cols
[2022-05-16 08:11:32] [INFO ] Computed 524 place invariants in 16 ms
[2022-05-16 08:11:32] [INFO ] Implicit Places using invariants in 723 ms returned [3, 207, 209, 258, 330, 349, 707, 978, 1095, 1286]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 727 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1291 places, 768/768 transitions.
Applied a total of 0 rules in 32 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1281/1291 places, 768/768 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s68 1) (GEQ s659 1)), p0:(AND (GEQ s876 1) (GEQ s1250 1)), p1:(AND (GEQ s705 1) (GEQ s936 1))], nbAcceptance=1, 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 174 reset in 2978 ms.
Product exploration explored 100000 steps with 142 reset in 3201 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 p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 286 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 412 steps, including 0 resets, run visited all 3 properties in 21 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 2 factoid took 336 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:11:41] [INFO ] Computed 514 place invariants in 10 ms
[2022-05-16 08:11:41] [INFO ] [Real]Absence check using 510 positive place invariants in 324 ms returned sat
[2022-05-16 08:11:42] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 112 ms returned sat
[2022-05-16 08:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:11:45] [INFO ] [Real]Absence check using state equation in 3613 ms returned sat
[2022-05-16 08:11:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 08:11:46] [INFO ] [Nat]Absence check using 510 positive place invariants in 324 ms returned sat
[2022-05-16 08:11:46] [INFO ] [Nat]Absence check using 510 positive and 4 generalized place invariants in 110 ms returned sat
[2022-05-16 08:11:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 08:11:49] [INFO ] [Nat]Absence check using state equation in 3109 ms returned sat
[2022-05-16 08:11:49] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 35 ms.
[2022-05-16 08:11:58] [INFO ] Added : 509 causal constraints over 102 iterations in 8164 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Applied a total of 0 rules in 38 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:11:58] [INFO ] Computed 514 place invariants in 14 ms
[2022-05-16 08:11:58] [INFO ] Implicit Places using invariants in 730 ms returned []
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:11:58] [INFO ] Computed 514 place invariants in 11 ms
[2022-05-16 08:12:00] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:12:00] [INFO ] Computed 514 place invariants in 10 ms
[2022-05-16 08:12:00] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1281/1281 places, 768/768 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 p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 259 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 252 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 2 factoid took 319 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:12:02] [INFO ] Computed 514 place invariants in 11 ms
[2022-05-16 08:12:03] [INFO ] [Real]Absence check using 510 positive place invariants in 320 ms returned sat
[2022-05-16 08:12:03] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 110 ms returned sat
[2022-05-16 08:12:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:12:06] [INFO ] [Real]Absence check using state equation in 3580 ms returned sat
[2022-05-16 08:12:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 08:12:07] [INFO ] [Nat]Absence check using 510 positive place invariants in 325 ms returned sat
[2022-05-16 08:12:07] [INFO ] [Nat]Absence check using 510 positive and 4 generalized place invariants in 110 ms returned sat
[2022-05-16 08:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 08:12:10] [INFO ] [Nat]Absence check using state equation in 3071 ms returned sat
[2022-05-16 08:12:11] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-16 08:12:19] [INFO ] Added : 509 causal constraints over 102 iterations in 8191 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 192 reset in 2991 ms.
Product exploration explored 100000 steps with 100 reset in 3093 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1281 transition count 768
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 252 place count 1281 transition count 768
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 254 place count 1281 transition count 768
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 255 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 255 place count 1281 transition count 768
Deduced a syphon composed of 255 places in 1 ms
Applied a total of 255 rules in 111 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2022-05-16 08:12:25] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:12:25] [INFO ] Computed 514 place invariants in 13 ms
[2022-05-16 08:12:26] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1281/1281 places, 768/768 transitions.
Finished structural reductions, in 1 iterations. Remains : 1281/1281 places, 768/768 transitions.
Product exploration explored 100000 steps with 67 reset in 2779 ms.
Product exploration explored 100000 steps with 30 reset in 3003 ms.
Built C files in :
/tmp/ltsmin8998541610795278199
[2022-05-16 08:12:32] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8998541610795278199
Running compilation step : cd /tmp/ltsmin8998541610795278199;'/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'
Compilation finished in 1329 ms.
Running link step : cd /tmp/ltsmin8998541610795278199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8998541610795278199;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13754406727610255198.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Applied a total of 0 rules in 40 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:12:47] [INFO ] Computed 514 place invariants in 11 ms
[2022-05-16 08:12:47] [INFO ] Implicit Places using invariants in 735 ms returned []
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:12:47] [INFO ] Computed 514 place invariants in 14 ms
[2022-05-16 08:12:49] [INFO ] Implicit Places using invariants and state equation in 1221 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
// Phase 1: matrix 768 rows 1281 cols
[2022-05-16 08:12:49] [INFO ] Computed 514 place invariants in 15 ms
[2022-05-16 08:12:49] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1281/1281 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin14924964726124759250
[2022-05-16 08:12:49] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14924964726124759250
Running compilation step : cd /tmp/ltsmin14924964726124759250;'/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'
Compilation finished in 1320 ms.
Running link step : cd /tmp/ltsmin14924964726124759250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14924964726124759250;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11378912045776765839.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 08:13:04] [INFO ] Flatten gal took : 25 ms
[2022-05-16 08:13:04] [INFO ] Flatten gal took : 25 ms
[2022-05-16 08:13:04] [INFO ] Time to serialize gal into /tmp/LTL3632469622316243476.gal : 2 ms
[2022-05-16 08:13:04] [INFO ] Time to serialize properties into /tmp/LTL9030452330506157781.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3632469622316243476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9030452330506157781.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/LTL3632469...266
Read 1 LTL properties
Checking formula 0 : !((X((G((F("((Section_49>=1)&&(F50>=1))"))||(X("((F6>=1)&&(Section_5>=1))"))))&&(F(X(G(F(G("((F427>=1)&&(Section_426>=1))")))))))))
Formula 0 simplified : !X(G(F"((Section_49>=1)&&(F50>=1))" | X"((F6>=1)&&(Section_5>=1))") & FXGFG"((F427>=1)&&(Section_426>=1))")
Detected timeout of ITS tools.
[2022-05-16 08:13:19] [INFO ] Flatten gal took : 26 ms
[2022-05-16 08:13:19] [INFO ] Applying decomposition
[2022-05-16 08:13:19] [INFO ] Flatten gal took : 25 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/graph10355064609146503005.txt' '-o' '/tmp/graph10355064609146503005.bin' '-w' '/tmp/graph10355064609146503005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10355064609146503005.bin' '-l' '-1' '-v' '-w' '/tmp/graph10355064609146503005.weights' '-q' '0' '-e' '0.001'
[2022-05-16 08:13:20] [INFO ] Decomposing Gal with order
[2022-05-16 08:13:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 08:13:20] [INFO ] Flatten gal took : 48 ms
[2022-05-16 08:13:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 08:13:20] [INFO ] Time to serialize gal into /tmp/LTL12848194364854332292.gal : 5 ms
[2022-05-16 08:13:20] [INFO ] Time to serialize properties into /tmp/LTL988088071899790086.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12848194364854332292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL988088071899790086.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/LTL1284819...245
Read 1 LTL properties
Checking formula 0 : !((X((G((F("((i24.i0.i0.u194.Section_49>=1)&&(i24.i0.i0.u84.F50>=1))"))||(X("((i37.i1.i1.u229.F6>=1)&&(i37.i1.i1.u146.Section_5>=1))")...225
Formula 0 simplified : !X(G(F"((i24.i0.i0.u194.Section_49>=1)&&(i24.i0.i0.u84.F50>=1))" | X"((i37.i1.i1.u229.F6>=1)&&(i37.i1.i1.u146.Section_5>=1))") & FXG...203
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3492570277823768393
[2022-05-16 08:13:35] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3492570277823768393
Running compilation step : cd /tmp/ltsmin3492570277823768393;'/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'
Compilation finished in 1328 ms.
Running link step : cd /tmp/ltsmin3492570277823768393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3492570277823768393;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((<>((LTLAPp0==true))||X((LTLAPp1==true))))&&<>(X([](<>([]((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-768-LTLFireability-13 finished in 138109 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((X(G(X(G(F(p0)))))&&(F(p1)||F(p2)))))))'
Support contains 6 out of 1291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Drop transitions removed 231 transitions
Trivial Post-agglo rules discarded 231 transitions
Performed 231 trivial Post agglomeration. Transition count delta: 231
Iterating post reduction 0 with 231 rules applied. Total rules applied 231 place count 1291 transition count 537
Reduce places removed 231 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 232 rules applied. Total rules applied 463 place count 1060 transition count 536
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 464 place count 1059 transition count 536
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 464 place count 1059 transition count 524
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 488 place count 1047 transition count 524
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 510 place count 1036 transition count 513
Applied a total of 510 rules in 71 ms. Remains 1036 /1291 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1036 cols
[2022-05-16 08:13:50] [INFO ] Computed 524 place invariants in 13 ms
[2022-05-16 08:13:51] [INFO ] Implicit Places using invariants in 687 ms returned [2, 166, 167, 206, 280, 567, 783, 871, 1012, 1032]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 689 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1291 places, 513/768 transitions.
Applied a total of 0 rules in 29 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1026/1291 places, 513/768 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s189 1) (GEQ s262 1)), p1:(AND (GEQ s106 1) (GEQ s443 1)), p2:(AND (GEQ s165 1) (GEQ s943 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 480 reset in 3621 ms.
Product exploration explored 100000 steps with 521 reset in 3842 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 (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 200 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Finished random walk after 335 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p0), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 221 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:13:59] [INFO ] Computed 514 place invariants in 8 ms
[2022-05-16 08:14:00] [INFO ] [Real]Absence check using 511 positive place invariants in 284 ms returned sat
[2022-05-16 08:14:00] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 101 ms returned sat
[2022-05-16 08:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:14:04] [INFO ] [Real]Absence check using state equation in 3818 ms returned sat
[2022-05-16 08:14:04] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-16 08:14:14] [INFO ] Added : 254 causal constraints over 51 iterations in 10343 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 37 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:14:14] [INFO ] Computed 514 place invariants in 14 ms
[2022-05-16 08:14:15] [INFO ] Implicit Places using invariants in 681 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:14:15] [INFO ] Computed 514 place invariants in 14 ms
[2022-05-16 08:14:16] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
[2022-05-16 08:14:16] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:14:16] [INFO ] Computed 514 place invariants in 10 ms
[2022-05-16 08:14:16] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1026/1026 places, 513/513 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 (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 235 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Finished random walk after 961 steps, including 0 resets, run visited all 2 properties in 38 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p0), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 290 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:14:18] [INFO ] Computed 514 place invariants in 7 ms
[2022-05-16 08:14:18] [INFO ] [Real]Absence check using 511 positive place invariants in 285 ms returned sat
[2022-05-16 08:14:19] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 100 ms returned sat
[2022-05-16 08:14:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:14:22] [INFO ] [Real]Absence check using state equation in 3798 ms returned sat
[2022-05-16 08:14:22] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-16 08:14:33] [INFO ] Added : 254 causal constraints over 51 iterations in 10367 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 544 reset in 3626 ms.
Product exploration explored 100000 steps with 564 reset in 3914 ms.
Built C files in :
/tmp/ltsmin17564305614501568921
[2022-05-16 08:14:40] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2022-05-16 08:14:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:14:40] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2022-05-16 08:14:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:14:40] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2022-05-16 08:14:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:14:40] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17564305614501568921
Running compilation step : cd /tmp/ltsmin17564305614501568921;'/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'
Compilation finished in 1210 ms.
Running link step : cd /tmp/ltsmin17564305614501568921;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17564305614501568921;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2875143263373591966.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 27 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:14:55] [INFO ] Computed 514 place invariants in 12 ms
[2022-05-16 08:14:56] [INFO ] Implicit Places using invariants in 672 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:14:56] [INFO ] Computed 514 place invariants in 5 ms
[2022-05-16 08:14:57] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
[2022-05-16 08:14:57] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:14:57] [INFO ] Computed 514 place invariants in 8 ms
[2022-05-16 08:14:57] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1026/1026 places, 513/513 transitions.
Built C files in :
/tmp/ltsmin15137635220385778647
[2022-05-16 08:14:57] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2022-05-16 08:14:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:14:57] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2022-05-16 08:14:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:14:57] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2022-05-16 08:14:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:14:57] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15137635220385778647
Running compilation step : cd /tmp/ltsmin15137635220385778647;'/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'
Compilation finished in 1214 ms.
Running link step : cd /tmp/ltsmin15137635220385778647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15137635220385778647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5950791804288787131.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 08:15:13] [INFO ] Flatten gal took : 20 ms
[2022-05-16 08:15:13] [INFO ] Flatten gal took : 20 ms
[2022-05-16 08:15:13] [INFO ] Time to serialize gal into /tmp/LTL12935385540483517799.gal : 2 ms
[2022-05-16 08:15:13] [INFO ] Time to serialize properties into /tmp/LTL6034566108144062949.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12935385540483517799.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6034566108144062949.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/LTL1293538...267
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(G(X(G(F("((Section_286>=1)&&(F287>=1))"))))))&&((F("((Section_237>=1)&&(F238>=1))"))||(F("((F201>=1)&&(Section_200>=1))"))...161
Formula 0 simplified : !XGX(XGXGF"((Section_286>=1)&&(F287>=1))" & (F"((Section_237>=1)&&(F238>=1))" | F"((F201>=1)&&(Section_200>=1))"))
Detected timeout of ITS tools.
[2022-05-16 08:15:28] [INFO ] Flatten gal took : 21 ms
[2022-05-16 08:15:28] [INFO ] Applying decomposition
[2022-05-16 08:15:28] [INFO ] Flatten gal took : 20 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/graph16945419240960935295.txt' '-o' '/tmp/graph16945419240960935295.bin' '-w' '/tmp/graph16945419240960935295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16945419240960935295.bin' '-l' '-1' '-v' '-w' '/tmp/graph16945419240960935295.weights' '-q' '0' '-e' '0.001'
[2022-05-16 08:15:28] [INFO ] Decomposing Gal with order
[2022-05-16 08:15:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 08:15:28] [INFO ] Flatten gal took : 31 ms
[2022-05-16 08:15:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-16 08:15:28] [INFO ] Time to serialize gal into /tmp/LTL604262957757095794.gal : 7 ms
[2022-05-16 08:15:28] [INFO ] Time to serialize properties into /tmp/LTL11009794414507379742.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL604262957757095794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11009794414507379742.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/LTL6042629...245
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(G(X(G(F("((i9.u93.Section_286>=1)&&(i9.u233.F287>=1))"))))))&&((F("((i23.u51.Section_237>=1)&&(i23.u230.F238>=1))"))||(F("...210
Formula 0 simplified : !XGX(XGXGF"((i9.u93.Section_286>=1)&&(i9.u233.F287>=1))" & (F"((i23.u51.Section_237>=1)&&(i23.u230.F238>=1))" | F"((i13.u21.F201>=1)...186
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7919751457673149326
[2022-05-16 08:15:43] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7919751457673149326
Running compilation step : cd /tmp/ltsmin7919751457673149326;'/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'
Compilation finished in 894 ms.
Running link step : cd /tmp/ltsmin7919751457673149326;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7919751457673149326;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X((X([](X([](<>((LTLAPp0==true))))))&&(<>((LTLAPp1==true))||<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-768-LTLFireability-14 finished in 128189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Drop transitions removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 233 place count 1291 transition count 535
Reduce places removed 233 places and 0 transitions.
Iterating post reduction 1 with 233 rules applied. Total rules applied 466 place count 1058 transition count 535
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 466 place count 1058 transition count 523
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 490 place count 1046 transition count 523
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 512 place count 1035 transition count 512
Applied a total of 512 rules in 62 ms. Remains 1035 /1291 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1035 cols
[2022-05-16 08:15:58] [INFO ] Computed 524 place invariants in 16 ms
[2022-05-16 08:15:59] [INFO ] Implicit Places using invariants in 701 ms returned [2, 166, 167, 205, 265, 279, 566, 782, 870, 1011, 1031]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 702 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1291 places, 512/768 transitions.
Applied a total of 0 rules in 38 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1024/1291 places, 512/768 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s219 1) (LT s882 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2641 ms.
Product exploration explored 100000 steps with 0 reset in 3010 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 435 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 27 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 08:16:05] [INFO ] Computed 513 place invariants in 15 ms
[2022-05-16 08:16:06] [INFO ] Implicit Places using invariants in 664 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 08:16:06] [INFO ] Computed 513 place invariants in 9 ms
[2022-05-16 08:16:07] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1602 ms to find 0 implicit places.
[2022-05-16 08:16:07] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 08:16:07] [INFO ] Computed 513 place invariants in 9 ms
[2022-05-16 08:16:07] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 512/512 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 272 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=24 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2673 ms.
Product exploration explored 100000 steps with 0 reset in 2999 ms.
Built C files in :
/tmp/ltsmin12169380642253642434
[2022-05-16 08:16:14] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-16 08:16:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:16:14] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-16 08:16:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:16:14] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-16 08:16:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:16:14] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12169380642253642434
Running compilation step : cd /tmp/ltsmin12169380642253642434;'/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'
Compilation finished in 1226 ms.
Running link step : cd /tmp/ltsmin12169380642253642434;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12169380642253642434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4551740867103265201.hoa' '--buchi-type=spotba'
LTSmin run took 7809 ms.
FORMULA CircularTrains-PT-768-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLFireability-15 finished in 24846 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&p1)))'
Found a CL insensitive property : CircularTrains-PT-768-LTLFireability-08
Stuttering acceptance computed with spot in 55 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 1291 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 232 place count 1291 transition count 536
Reduce places removed 232 places and 0 transitions.
Iterating post reduction 1 with 232 rules applied. Total rules applied 464 place count 1059 transition count 536
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 464 place count 1059 transition count 524
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 488 place count 1047 transition count 524
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 510 place count 1036 transition count 513
Applied a total of 510 rules in 69 ms. Remains 1036 /1291 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1036 cols
[2022-05-16 08:16:23] [INFO ] Computed 524 place invariants in 10 ms
[2022-05-16 08:16:24] [INFO ] Implicit Places using invariants in 644 ms returned [2, 166, 167, 205, 265, 279, 567, 783, 871, 1012]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 648 ms to find 10 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1026/1291 places, 513/768 transitions.
Applied a total of 0 rules in 23 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1026/1291 places, 513/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s249 1) (LT s432 1)), p0:(OR (LT s331 1) (LT s1022 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 35880 reset in 3642 ms.
Product exploration explored 100000 steps with 37201 reset in 3897 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 : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 469 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p1 p0), (X p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1026 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 29 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:16:32] [INFO ] Computed 514 place invariants in 12 ms
[2022-05-16 08:16:33] [INFO ] Implicit Places using invariants in 678 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:16:33] [INFO ] Computed 514 place invariants in 13 ms
[2022-05-16 08:16:34] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:16:34] [INFO ] Computed 514 place invariants in 5 ms
[2022-05-16 08:16:34] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1026/1026 places, 513/513 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 292 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=26 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 37785 reset in 3668 ms.
Product exploration explored 100000 steps with 36308 reset in 3888 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 27 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2022-05-16 08:16:43] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:16:43] [INFO ] Computed 514 place invariants in 5 ms
[2022-05-16 08:16:43] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1026/1026 places, 513/513 transitions.
Product exploration explored 100000 steps with 37061 reset in 7967 ms.
Product exploration explored 100000 steps with 39468 reset in 8531 ms.
Built C files in :
/tmp/ltsmin1177640696874423007
[2022-05-16 08:17:00] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1177640696874423007
Running compilation step : cd /tmp/ltsmin1177640696874423007;'/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'
Compilation finished in 937 ms.
Running link step : cd /tmp/ltsmin1177640696874423007;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1177640696874423007;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9294822271133998290.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1026 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 19 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:17:15] [INFO ] Computed 514 place invariants in 8 ms
[2022-05-16 08:17:16] [INFO ] Implicit Places using invariants in 677 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:17:16] [INFO ] Computed 514 place invariants in 6 ms
[2022-05-16 08:17:17] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:17:17] [INFO ] Computed 514 place invariants in 8 ms
[2022-05-16 08:17:17] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1026/1026 places, 513/513 transitions.
Built C files in :
/tmp/ltsmin2262141975286077565
[2022-05-16 08:17:17] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2262141975286077565
Running compilation step : cd /tmp/ltsmin2262141975286077565;'/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'
Compilation finished in 916 ms.
Running link step : cd /tmp/ltsmin2262141975286077565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2262141975286077565;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3858842477956570217.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 08:17:32] [INFO ] Flatten gal took : 20 ms
[2022-05-16 08:17:32] [INFO ] Flatten gal took : 20 ms
[2022-05-16 08:17:32] [INFO ] Time to serialize gal into /tmp/LTL6390243552389076304.gal : 3 ms
[2022-05-16 08:17:32] [INFO ] Time to serialize properties into /tmp/LTL1982512674301608894.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6390243552389076304.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1982512674301608894.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/LTL6390243...266
Read 1 LTL properties
Checking formula 0 : !((F((X(F("((Section_613<1)||(F614<1))")))&&("((Section_677<1)||(F678<1))"))))
Formula 0 simplified : !F("((Section_677<1)||(F678<1))" & XF"((Section_613<1)||(F614<1))")
Detected timeout of ITS tools.
[2022-05-16 08:17:47] [INFO ] Flatten gal took : 18 ms
[2022-05-16 08:17:47] [INFO ] Applying decomposition
[2022-05-16 08:17:47] [INFO ] Flatten gal took : 17 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/graph3514997323899976033.txt' '-o' '/tmp/graph3514997323899976033.bin' '-w' '/tmp/graph3514997323899976033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3514997323899976033.bin' '-l' '-1' '-v' '-w' '/tmp/graph3514997323899976033.weights' '-q' '0' '-e' '0.001'
[2022-05-16 08:17:47] [INFO ] Decomposing Gal with order
[2022-05-16 08:17:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 08:17:47] [INFO ] Flatten gal took : 27 ms
[2022-05-16 08:17:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 08:17:47] [INFO ] Time to serialize gal into /tmp/LTL8880121849791781148.gal : 6 ms
[2022-05-16 08:17:47] [INFO ] Time to serialize properties into /tmp/LTL15577820211634231997.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8880121849791781148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15577820211634231997.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/LTL8880121...246
Read 1 LTL properties
Checking formula 0 : !((F((X(F("((i14.u171.Section_613<1)||(i14.u171.F614<1))")))&&("((i25.u414.Section_677<1)||(i25.u221.F678<1))"))))
Formula 0 simplified : !F("((i25.u414.Section_677<1)||(i25.u221.F678<1))" & XF"((i14.u171.Section_613<1)||(i14.u171.F614<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14707262280034037786
[2022-05-16 08:18:02] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14707262280034037786
Running compilation step : cd /tmp/ltsmin14707262280034037786;'/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'
Compilation finished in 918 ms.
Running link step : cd /tmp/ltsmin14707262280034037786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14707262280034037786;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(<>((LTLAPp0==true)))&&(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-768-LTLFireability-08 finished in 114602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U !(G(X(X((X(!p1)||p2)))) U p2)))'
Found a CL insensitive property : CircularTrains-PT-768-LTLFireability-12
Stuttering acceptance computed with spot in 297 ms :[p2, true, p2, p2, (OR (NOT p1) p2), p2, (NOT p1), p2, (AND p2 (NOT p1)), (AND (NOT p1) p2)]
Support contains 6 out of 1291 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 232 place count 1291 transition count 536
Reduce places removed 232 places and 0 transitions.
Iterating post reduction 1 with 232 rules applied. Total rules applied 464 place count 1059 transition count 536
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 464 place count 1059 transition count 525
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 486 place count 1048 transition count 525
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 508 place count 1037 transition count 514
Applied a total of 508 rules in 61 ms. Remains 1037 /1291 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1037 cols
[2022-05-16 08:18:18] [INFO ] Computed 524 place invariants in 5 ms
[2022-05-16 08:18:19] [INFO ] Implicit Places using invariants in 672 ms returned [2, 168, 206, 266, 280, 567, 872, 1013, 1033]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 673 ms to find 9 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1028/1291 places, 514/768 transitions.
Applied a total of 0 rules in 29 ms. Remains 1028 /1028 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1028/1291 places, 514/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=p2, acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 6}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 8}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 p0), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 9}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 8}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s166 1) (GEQ s831 1)), p0:(AND (GEQ s166 1) (GEQ s831 1) (GEQ s61 1) (GEQ s777 1)), p1:(OR (LT s72 1) (LT s979 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], 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 17106 reset in 4092 ms.
Product exploration explored 100000 steps with 17925 reset in 4417 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 p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), true, (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge based reduction with 6 factoid took 572 ms. Reduced automaton from 10 states, 26 edges and 3 AP to 7 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 244 ms :[p2, p2, (OR (NOT p1) p2), (NOT p1), p2, (AND p2 (NOT p1)), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 514 rows 1028 cols
[2022-05-16 08:18:29] [INFO ] Computed 515 place invariants in 15 ms
[2022-05-16 08:18:29] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), true, (X (X (NOT (AND (NOT p2) p0)))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND (NOT p1) p0 (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F (AND (NOT p0) p2)), (F (AND p0 p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND (NOT p1) p0 p2))]
Knowledge based reduction with 8 factoid took 806 ms. Reduced automaton from 7 states, 16 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 221 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), (OR (NOT p1) p2), (NOT p1), (OR p2 (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 220 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), (OR (NOT p1) p2), (NOT p1), (OR p2 (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))]
Support contains 6 out of 1028 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1028/1028 places, 514/514 transitions.
Applied a total of 0 rules in 24 ms. Remains 1028 /1028 variables (removed 0) and now considering 514/514 (removed 0) transitions.
// Phase 1: matrix 514 rows 1028 cols
[2022-05-16 08:18:30] [INFO ] Computed 515 place invariants in 9 ms
[2022-05-16 08:18:31] [INFO ] Implicit Places using invariants in 668 ms returned []
// Phase 1: matrix 514 rows 1028 cols
[2022-05-16 08:18:31] [INFO ] Computed 515 place invariants in 13 ms
[2022-05-16 08:18:32] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
// Phase 1: matrix 514 rows 1028 cols
[2022-05-16 08:18:32] [INFO ] Computed 515 place invariants in 13 ms
[2022-05-16 08:18:32] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1028/1028 places, 514/514 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 p2) p1 (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 221 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), (OR (NOT p1) p2), (NOT p1), (OR p2 (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))]
Finished random walk after 1727 steps, including 0 resets, run visited all 7 properties in 76 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (F (AND (NOT p0) p2)), (F p0), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 1 factoid took 341 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 220 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), (OR (NOT p1) p2), (NOT p1), (OR p2 (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 225 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), (OR (NOT p1) p2), (NOT p1), (OR p2 (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 221 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), (OR (NOT p1) p2), (NOT p1), (OR p2 (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))]
Product exploration explored 100000 steps with 17661 reset in 4080 ms.
Product exploration explored 100000 steps with 16910 reset in 4327 ms.
Built C files in :
/tmp/ltsmin5581401131625849259
[2022-05-16 08:18:43] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5581401131625849259
Running compilation step : cd /tmp/ltsmin5581401131625849259;'/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'
Compilation finished in 911 ms.
Running link step : cd /tmp/ltsmin5581401131625849259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5581401131625849259;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9276440632430629691.hoa' '--buchi-type=spotba'
LTSmin run took 10326 ms.
Treatment of property CircularTrains-PT-768-LTLFireability-12 finished in 36556 ms.
CL/SL decision was in the wrong direction : CL + false
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)||X(p1)))&&F(X(G(F(G(p2))))))))'
Found a SL insensitive property : CircularTrains-PT-768-LTLFireability-13
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 6 out of 1291 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1291/1291 places, 768/768 transitions.
Drop transitions removed 231 transitions
Trivial Post-agglo rules discarded 231 transitions
Performed 231 trivial Post agglomeration. Transition count delta: 231
Iterating post reduction 0 with 231 rules applied. Total rules applied 231 place count 1291 transition count 537
Reduce places removed 231 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 232 rules applied. Total rules applied 463 place count 1060 transition count 536
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 464 place count 1059 transition count 536
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 464 place count 1059 transition count 524
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 488 place count 1047 transition count 524
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 510 place count 1036 transition count 513
Applied a total of 510 rules in 65 ms. Remains 1036 /1291 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1036 cols
[2022-05-16 08:18:54] [INFO ] Computed 524 place invariants in 15 ms
[2022-05-16 08:18:55] [INFO ] Implicit Places using invariants in 672 ms returned [2, 166, 167, 205, 265, 279, 566, 783, 871, 1032]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 673 ms to find 10 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1026/1291 places, 513/768 transitions.
Applied a total of 0 rules in 26 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1026/1291 places, 513/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s57 1) (GEQ s532 1)), p0:(AND (GEQ s699 1) (GEQ s1003 1)), p1:(AND (GEQ s563 1) (GEQ s751 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 68 reset in 2741 ms.
Product exploration explored 100000 steps with 120 reset in 3218 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 p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 307 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 194 steps, including 0 resets, run visited all 3 properties in 20 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 2 factoid took 384 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:19:03] [INFO ] Computed 514 place invariants in 6 ms
[2022-05-16 08:19:03] [INFO ] [Real]Absence check using 510 positive place invariants in 281 ms returned sat
[2022-05-16 08:19:03] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 74 ms returned sat
[2022-05-16 08:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:19:06] [INFO ] [Real]Absence check using state equation in 2387 ms returned sat
[2022-05-16 08:19:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 08:19:07] [INFO ] [Nat]Absence check using 510 positive place invariants in 277 ms returned sat
[2022-05-16 08:19:07] [INFO ] [Nat]Absence check using 510 positive and 4 generalized place invariants in 99 ms returned sat
[2022-05-16 08:19:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 08:19:07] [INFO ] [Nat]Absence check using state equation in 804 ms returned sat
[2022-05-16 08:19:07] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-16 08:19:10] [INFO ] Added : 254 causal constraints over 51 iterations in 2481 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 23 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:19:10] [INFO ] Computed 514 place invariants in 9 ms
[2022-05-16 08:19:11] [INFO ] Implicit Places using invariants in 656 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:19:11] [INFO ] Computed 514 place invariants in 6 ms
[2022-05-16 08:19:12] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:19:12] [INFO ] Computed 514 place invariants in 11 ms
[2022-05-16 08:19:12] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1026/1026 places, 513/513 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 p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 309 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 832 steps, including 0 resets, run visited all 3 properties in 34 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 2 factoid took 338 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:19:14] [INFO ] Computed 514 place invariants in 16 ms
[2022-05-16 08:19:14] [INFO ] [Real]Absence check using 510 positive place invariants in 270 ms returned sat
[2022-05-16 08:19:14] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 74 ms returned sat
[2022-05-16 08:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:19:17] [INFO ] [Real]Absence check using state equation in 2360 ms returned sat
[2022-05-16 08:19:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 08:19:17] [INFO ] [Nat]Absence check using 510 positive place invariants in 283 ms returned sat
[2022-05-16 08:19:18] [INFO ] [Nat]Absence check using 510 positive and 4 generalized place invariants in 110 ms returned sat
[2022-05-16 08:19:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 08:19:18] [INFO ] [Nat]Absence check using state equation in 812 ms returned sat
[2022-05-16 08:19:18] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-16 08:19:21] [INFO ] Added : 254 causal constraints over 51 iterations in 2525 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 22 reset in 2701 ms.
Product exploration explored 100000 steps with 43 reset in 3072 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 27 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2022-05-16 08:19:27] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:19:27] [INFO ] Computed 514 place invariants in 9 ms
[2022-05-16 08:19:27] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1026/1026 places, 513/513 transitions.
Product exploration explored 100000 steps with 18 reset in 2706 ms.
Product exploration explored 100000 steps with 524 reset in 4008 ms.
Built C files in :
/tmp/ltsmin9434204967560712126
[2022-05-16 08:19:34] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9434204967560712126
Running compilation step : cd /tmp/ltsmin9434204967560712126;'/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'
Compilation finished in 912 ms.
Running link step : cd /tmp/ltsmin9434204967560712126;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9434204967560712126;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2973341092223443222.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 24 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:19:49] [INFO ] Computed 514 place invariants in 14 ms
[2022-05-16 08:19:50] [INFO ] Implicit Places using invariants in 690 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:19:50] [INFO ] Computed 514 place invariants in 12 ms
[2022-05-16 08:19:51] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 08:19:51] [INFO ] Computed 514 place invariants in 9 ms
[2022-05-16 08:19:51] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1026/1026 places, 513/513 transitions.
Built C files in :
/tmp/ltsmin17189347086813548465
[2022-05-16 08:19:51] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17189347086813548465
Running compilation step : cd /tmp/ltsmin17189347086813548465;'/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'
Compilation finished in 1005 ms.
Running link step : cd /tmp/ltsmin17189347086813548465;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17189347086813548465;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1181550264254551951.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 08:20:06] [INFO ] Flatten gal took : 20 ms
[2022-05-16 08:20:06] [INFO ] Flatten gal took : 17 ms
[2022-05-16 08:20:07] [INFO ] Time to serialize gal into /tmp/LTL10072569135270986413.gal : 2 ms
[2022-05-16 08:20:07] [INFO ] Time to serialize properties into /tmp/LTL14565054675203546727.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10072569135270986413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14565054675203546727.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/LTL1007256...268
Read 1 LTL properties
Checking formula 0 : !((X((G((F("((Section_49>=1)&&(F50>=1))"))||(X("((F6>=1)&&(Section_5>=1))"))))&&(F(X(G(F(G("((F427>=1)&&(Section_426>=1))")))))))))
Formula 0 simplified : !X(G(F"((Section_49>=1)&&(F50>=1))" | X"((F6>=1)&&(Section_5>=1))") & FXGFG"((F427>=1)&&(Section_426>=1))")
Detected timeout of ITS tools.
[2022-05-16 08:20:22] [INFO ] Flatten gal took : 19 ms
[2022-05-16 08:20:22] [INFO ] Applying decomposition
[2022-05-16 08:20:22] [INFO ] Flatten gal took : 17 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/graph474089299974381023.txt' '-o' '/tmp/graph474089299974381023.bin' '-w' '/tmp/graph474089299974381023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph474089299974381023.bin' '-l' '-1' '-v' '-w' '/tmp/graph474089299974381023.weights' '-q' '0' '-e' '0.001'
[2022-05-16 08:20:22] [INFO ] Decomposing Gal with order
[2022-05-16 08:20:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 08:20:22] [INFO ] Flatten gal took : 25 ms
[2022-05-16 08:20:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 08:20:22] [INFO ] Time to serialize gal into /tmp/LTL6233551793858836785.gal : 4 ms
[2022-05-16 08:20:22] [INFO ] Time to serialize properties into /tmp/LTL13366971293073938632.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6233551793858836785.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13366971293073938632.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/LTL6233551...246
Read 1 LTL properties
Checking formula 0 : !((X((G((F("((i24.u297.Section_49>=1)&&(i24.u297.F50>=1))"))||(X("((i18.u293.F6>=1)&&(i18.u374.Section_5>=1))"))))&&(F(X(G(F(G("((i30....205
Formula 0 simplified : !X(G(F"((i24.u297.Section_49>=1)&&(i24.u297.F50>=1))" | X"((i18.u293.F6>=1)&&(i18.u374.Section_5>=1))") & FXGFG"((i30.u326.F427>=1)&...183
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16260057158319343090
[2022-05-16 08:20:37] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16260057158319343090
Running compilation step : cd /tmp/ltsmin16260057158319343090;'/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'
Compilation finished in 915 ms.
Running link step : cd /tmp/ltsmin16260057158319343090;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16260057158319343090;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((<>((LTLAPp0==true))||X((LTLAPp1==true))))&&<>(X([](<>([]((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-768-LTLFireability-13 finished in 117878 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((X(G(X(G(F(p0)))))&&(F(p1)||F(p2)))))))'
[2022-05-16 08:20:52] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6187715355943039832
[2022-05-16 08:20:52] [INFO ] Computing symmetric may disable matrix : 768 transitions.
[2022-05-16 08:20:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:20:52] [INFO ] Applying decomposition
[2022-05-16 08:20:52] [INFO ] Computing symmetric may enable matrix : 768 transitions.
[2022-05-16 08:20:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:20:52] [INFO ] Flatten gal took : 22 ms
[2022-05-16 08:20:52] [INFO ] Computing Do-Not-Accords matrix : 768 transitions.
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/graph7178182297211019526.txt' '-o' '/tmp/graph7178182297211019526.bin' '-w' '/tmp/graph7178182297211019526.weights'
[2022-05-16 08:20:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:20:52] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6187715355943039832
Running compilation step : cd /tmp/ltsmin6187715355943039832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' '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'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7178182297211019526.bin' '-l' '-1' '-v' '-w' '/tmp/graph7178182297211019526.weights' '-q' '0' '-e' '0.001'
[2022-05-16 08:20:52] [INFO ] Decomposing Gal with order
[2022-05-16 08:20:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 08:20:52] [INFO ] Flatten gal took : 28 ms
[2022-05-16 08:20:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 08:20:52] [INFO ] Time to serialize gal into /tmp/LTLFireability4580087117692611749.gal : 4 ms
[2022-05-16 08:20:52] [INFO ] Time to serialize properties into /tmp/LTLFireability10427736968998770903.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4580087117692611749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10427736968998770903.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 4 LTL properties
Checking formula 0 : !((F((X(F("((i14.i1.i1.u101.Section_613<1)||(i14.i1.i1.u101.F614<1))")))&&("((i3.i0.i1.u27.Section_677<1)||(i3.i0.i0.u133.F678<1))")))...156
Formula 0 simplified : !F("((i3.i0.i1.u27.Section_677<1)||(i3.i0.i0.u133.F678<1))" & XF"((i14.i1.i1.u101.Section_613<1)||(i14.i1.i1.u101.F614<1))")
Compilation finished in 1976 ms.
Running link step : cd /tmp/ltsmin6187715355943039832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6187715355943039832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(<>((LTLAPp0==true)))&&(LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: LTL layer: formula: <>((X(<>((LTLAPp0==true)))&&(LTLAPp1==true)))
pins2lts-mc-linux64( 1/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.024: "<>((X(<>((LTLAPp0==true)))&&(LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.043: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.052: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.167: DFS-FIFO for weak LTL, using special progress label 780
pins2lts-mc-linux64( 0/ 8), 0.167: There are 781 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.167: State length is 1292, there are 771 groups
pins2lts-mc-linux64( 0/ 8), 0.167: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.167: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.167: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.167: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 1.258: ~67 levels ~960 states ~136816 transitions
pins2lts-mc-linux64( 5/ 8), 2.270: ~186 levels ~1920 states ~359656 transitions
pins2lts-mc-linux64( 5/ 8), 3.416: ~426 levels ~3840 states ~716248 transitions
pins2lts-mc-linux64( 5/ 8), 5.043: ~903 levels ~7680 states ~1326024 transitions
pins2lts-mc-linux64( 7/ 8), 7.868: ~1867 levels ~15360 states ~2472664 transitions
pins2lts-mc-linux64( 5/ 8), 13.734: ~3762 levels ~30720 states ~4684192 transitions
pins2lts-mc-linux64( 1/ 8), 20.648: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 25.133:
pins2lts-mc-linux64( 0/ 8), 25.133: mean standard work distribution: 2.7% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 25.133:
pins2lts-mc-linux64( 0/ 8), 25.133: Explored 39965 states 6059543 transitions, fanout: 151.621
pins2lts-mc-linux64( 0/ 8), 25.133: Total exploration time 24.940 sec (23.010 sec minimum, 24.105 sec on average)
pins2lts-mc-linux64( 0/ 8), 25.133: States per second: 1602, Transitions per second: 242965
pins2lts-mc-linux64( 0/ 8), 25.133:
pins2lts-mc-linux64( 0/ 8), 25.133: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 25.133: Redundant explorations: -99.3401
pins2lts-mc-linux64( 0/ 8), 25.133:
pins2lts-mc-linux64( 0/ 8), 25.133: Queue width: 8B, total height: 39446, memory: 0.30MB
pins2lts-mc-linux64( 0/ 8), 25.133: Tree memory: 302.2MB, 52.3 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 25.133: Tree fill ratio (roots/leafs): 4.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 25.133: Stored 776 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 25.133: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 25.133: Est. total memory use: 302.5MB (~1024.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6187715355943039832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(<>((LTLAPp0==true)))&&(LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6187715355943039832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(<>((LTLAPp0==true)))&&(LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 08:46:15] [INFO ] Flatten gal took : 167 ms
[2022-05-16 08:46:15] [INFO ] Time to serialize gal into /tmp/LTLFireability7345063521769783394.gal : 27 ms
[2022-05-16 08:46:15] [INFO ] Time to serialize properties into /tmp/LTLFireability14559492924721678613.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/LTLFireability7345063521769783394.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14559492924721678613.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 4 LTL properties
Checking formula 0 : !((F((X(F("((Section_613<1)||(F614<1))")))&&("((Section_677<1)||(F678<1))"))))
Formula 0 simplified : !F("((Section_677<1)||(F678<1))" & XF"((Section_613<1)||(F614<1))")
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="CircularTrains-PT-768"
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 CircularTrains-PT-768, 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 r024-tall-165251919000764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-768.tgz
mv CircularTrains-PT-768 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 ;